CSc 404 Home

A New Puzzle

Create a prolog program to solve the peg jump puzzle described here. The game has eight pegs in nine holes. At the start, the four red pegs on the left and the four blue pegs are on the right, with an empty hole between. The object is to reverse the colors (move all red to the right and blue to the left) using a sequence of legal moves. Legal moves are:

• Pegs may only move forward (red may move right and blue left).
• A peg may move forward one step into an open position.
• A peg may skip over exactly one peg of the opposite color, if the position beyond it is open.
• There are no other legal moves.

⇒ ⇒ ⇒ ⇒ …

You should model your code after the peg jump puzzle example. In fact, I would recommend you start with that file and modify it. Change the representation of board to the one implied above, where your board is simply a list of length 9, each member being r, b, or o for a red or blue peg, or the empty slot. Change the definition of jump to represent a legal jump under these new rules, and the definition of solution to represent the correct starting state and goal. You may find that this project is actually pretty easy.

Submission