#TRIANGLE PEG SOLITAIRE SOLUTION CRACKER#

If the game is not over, it cycles through the list of all possible moves and checks to see which ones that apply to the state of the board that has been passed through as a parameter. It appends to the simulation.moves list a snapshot of the game and returns. So, when move is called, it checks to see if there are any moves left. board.poss_moves is a list of all possible moves the 5 row triangle board contains.board is a board object and temp_stack is the running stack for a current try at solving the game.It also has as one of its members a list called moves, which stores all the moves for each possible path that can be taken for each game. There is a Simulation class that instantiates a simulation object, which contains the move() function.The background you may need to understand it is as follows: Turns out C++ probably wouldn't have been too bad a choice but I'm enjoying the experience of learning Python.īelow, you'll find the code for the main recursive algorithm for moving along the board and solving it. Taking user-entered strings and using them as integers is just easier in interpreted languages.I initially thought my data structure would be more involved so I chose Python over C++ to open up the opportunity to use dictionaries.I'm new to Python so I want to learn it.

I chose Python as my language of choice for a few reasons:

My solver will solve for all solutions for a given starting hole, whether the game ends with one peg, two, etc. It's the game where you start out with pegs in holes, with one hole empty, then jump pegs (like checkers) and try to get exactly one peg remaining in the end.

#TRIANGLE PEG SOLITAIRE SOLUTION CRACKER#

It will allow the user to select the shape of the board in the future but for now I'm testing it with a standard 5 row triangle game, like the ones you find in Cracker Barrel. I am in the process of writing a peg solitaire solver in Python.

Triangle peg solitaire solution