In a proposed solution, a “depth first” search is used ( ) which tries to search (make trial moves) as deeply as possible, and backs up only when it hits a dead end, at which point back tracking is used ( ). (Source: ).Īn algorithm which blindly checks all the possibilities will not work quickly, and even with a very fast machine it would take years to solve. The game is won when all of the pegs are removed except one, which is in the center hole.įor the version with 33 holes (and 32 pegs) of Peg Solitaire there are 577,116,156,815,309,849,672 different game sequences (577+ quintillion possible games), with 40,861,647,040,079,968 solutions. Play continues with a peg jumping over another peg into an empty hole until there are no possible moves left. A peg can only jump one peg at a time, but as with Checkers, a peg can make a series of multiple jumps if there are open holes. A peg can jump left, right, up or down but cannot jump diagonally. The first move begins with a peg jumping over another peg into an empty hole. The game starts with all the holes on the board filled with a peg except the hole in the center, which is empty. Once a peg has been jumped over, it is removed from the board.
The rules of Peg solitaire are similar to Checkers, in that a peg can jump over another peg as long as there is an empty hole on the other side. The first evidence of the game can be traced back to 1697. The game is also known as Brainvita (especially in India). In the United Kingdom the game is referred to as Solitaire while the card games are called Patience. Peg solitaire (or Solo Noble) is a single player board game involving movement of pegs on a board with holes. C++ program solving Peg solitaire game About Peg Solitaire.
0 kommentar(er)
