Peg solitaire is a popular board game for one player. Choose a challenge problem and start to play.
Moves are made horizontally or vertically. A move can be made if a middle peg has another peg on one side and a hole on the other. In that case, the side peg jumps over the middle peg into the hole, and the middle peg is removed. The object is to remove all but one of the pegs on the board, with the last peg in the center of the board.
Tip: If you cannot solve a puzzle, press the "restart and solve" button to step through a solution.
[1] M. Kiyomi and T. Matsui, "Integer Programming Based Algorithms for Peg Solitaire Problems," Computers and Games, 2001 pp. 229–240.
[2] C. Jefferson, A. Miguel, I. Miguel, and A. Tarim, "Modelling and Solving English Peg Solitaire," Computers and Operations Research, 33(10), 2006 pp. 2935–2959.
[3] S. S. Skiena, The Algorithm Design Manual, 2nd ed., New York: Springer, 2008 pp. 231–233.
[4] D. E. Knuth, "Estimating the Efficiency of Backtrack Programs," Mathematics of Computation,29(3), 1975 pp. 121–136.
![[Snapshot]](HTMLImages/index.en/thumbnail_1.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_2.gif)
![[Snapshot]](HTMLImages/index.en/thumbnail_3.gif)
Embed Interactive Demonstration 
Browse all topics
