MazeWorks
Java Games and PuzzlesHomeBooksDownloadLinksEmail
English 16

The object of the puzzle is to transpose the positions of the gold and silver pieces in the fewest number of moves.

Click on a piece with the mouse to move it into the vacant square. A piece may either be moved to an adjacent vacant square, or jumped over an adjacent piece (of either color) to the vacant square. No diagonal moves or jumps are permitted.

The Solve button will initiate a search for a solution, then run the found solution. ( If you're curious, the technique used to find a solution is called Depth-First Search. See How to Build a Maze for more information on this particular algorithm. )

Note: The shortest known solution, discovered by the British puzzle expert H. E. Dudeney, consists of 46 moves.

Home