Embedded Files
Project Overview
Project Overview
In this project, we used simple object-oriented programming practices and built classes to abstract the ideas of the signpost game. In addition, we learned how to use Make and Git in order to save and test our code, along with how to make and use unit tests and integration tests.
In this project, we used simple object-oriented programming practices and built classes to abstract the ideas of the signpost game. In addition, we learned how to use Make and Git in order to save and test our code, along with how to make and use unit tests and integration tests.
The Puzzle
The Puzzle
The puzzle was created by Angela and Otto Janko, who call it Pfeilpfad (arrow path). In this project, we are given an incomplete Java program that creates these puzzles and allows its user to solve them, and we supplied the missing parts to complete the implementation.
The puzzle was created by Angela and Otto Janko, who call it Pfeilpfad (arrow path). In this project, we are given an incomplete Java program that creates these puzzles and allows its user to solve them, and we supplied the missing parts to complete the implementation.
The puzzle itself is played on a W×H rectangular grid of square cells. Every square on the board is annotated with an arrow pointing horizontally, vertically, or diagonally. One special square, the goal, is not annotated with an arrow, but instead is annotated with a star. The goal square also contains the number W⋅H. Another special square, the start, always contains the number 1. By default, the start and the goal will appear in the top-left and bottom-right corners of the board, respectively. Alternatively, the puzzle may be set to have free ends, in which case the start and the goal squares may appear anywhere on the board. The bottom-left corner of the board has the coordinates (0,0)(0,0), with the positive x-axis running horizontally to the right, and the positive y-axis running vertically upwards.
The puzzle itself is played on a W×H rectangular grid of square cells. Every square on the board is annotated with an arrow pointing horizontally, vertically, or diagonally. One special square, the goal, is not annotated with an arrow, but instead is annotated with a star. The goal square also contains the number W⋅H. Another special square, the start, always contains the number 1. By default, the start and the goal will appear in the top-left and bottom-right corners of the board, respectively. Alternatively, the puzzle may be set to have free ends, in which case the start and the goal squares may appear anywhere on the board. The bottom-left corner of the board has the coordinates (0,0)(0,0), with the positive x-axis running horizontally to the right, and the positive y-axis running vertically upwards.
The player's goal is to assign each unnumbered square a sequence number so that the squares form a chain following the arrows from 1 to W⋅H, using up all numbers in between. We say that square A is connectable to square B if B is one queen move away from A in the direction specified by A's arrow (here, "queen move" refers to the queen move in chess.)
The player's goal is to assign each unnumbered square a sequence number so that the squares form a chain following the arrows from 1 to W⋅H, using up all numbers in between. We say that square A is connectable to square B if B is one queen move away from A in the direction specified by A's arrow (here, "queen move" refers to the queen move in chess.)
When playing the game, the player is not obligated to start forming the sequence from the start. Two connectable squares can be connected even if they are unnumbered. That is, we can form groups of connected squares on the board, which may be connected later to form the solution sequence. If a group does not contain a numbered square, its squares are assigned a letter and an offset. For example, a, a + 1, a + 2 for the 1st, 2nd, and 3rd squares in the group's sequence. Once an unnumbered group is connected to a group whose squares are numbered, the members of the unnumbered group become numbered appropriately.
When playing the game, the player is not obligated to start forming the sequence from the start. Two connectable squares can be connected even if they are unnumbered. That is, we can form groups of connected squares on the board, which may be connected later to form the solution sequence. If a group does not contain a numbered square, its squares are assigned a letter and an offset. For example, a, a + 1, a + 2 for the 1st, 2nd, and 3rd squares in the group's sequence. Once an unnumbered group is connected to a group whose squares are numbered, the members of the unnumbered group become numbered appropriately.
The diagrams below show a sample puzzle on the left and its solution on the right.
The diagrams below show a sample puzzle on the left and its solution on the right.
Playing the Game
Playing the Game
In order to try the game, download proj0.zip* and unzip the file. Then, navigate to the "proj0" folder with your terminal and run the command "java -ea signpost.Main" without quotation marks.
In order to try the game, download proj0.zip* and unzip the file. Then, navigate to the "proj0" folder with your terminal and run the command "java -ea signpost.Main" without quotation marks.
*Due to instructional confidentiality, I may only privately share my code for employment purposes.
Page updated
Google Sites
Report abuse