Is this the right approach? It feels a little too abstract because I'd have to represent the edges as peg moves, but that's weird cause they're usually numbers or constraint. With the game dating back to the 17th Century, it was said to be. Then the children of each of those nodes would be the possible moves for them and you can find a solution once you've reached depth 31 in the tree because there are 32 pegs and you win the game where there's only 1 left. The History of Peg Solitaire or Solitaire Peg Solitaire has a long and interesting history. So the root node would the initial state which is the board shown above then it's children would be the state of the board after any of the possible legal actions that can be taken. Peg Solitaire is played by jumping any peg on the board over an adjacent peg into an empty space, and removing the jumped peg.
I had the idea of converting the problem to a tree where each node represents the state after an action is taken and each edge represents the action taken. A peg can only jump if the it's jumping into an empty space as shown in the picture above. Many variants of the game are reversals: the objective is to reverse the starting position, replacing pegs with holes and vice-versa. Chinese Checkers has been used to refer to Peg solitaire games in general, but this term should be retained to refer to the multi-player Chinese Checkers.
The goal is to only have one peg on the board and you get rid of pegs by jump one peg over another.
Peg solitaire games how to#
I've been reading research papers on how to solve a peg solitaire using graph search, but all the papers kind of assume you know how to do the reduction(polynomial time conversion) from the peg solitaire to the graph, which I do not, but this is how I assumed it was done.įor those of you unfamiliar, here is a video that illustrates how to play this game, and here's an image of a board.
0 kommentar(er)
