#36 PEG SOLITAIRE SOLUTION SERIES#

If we come across the previously seen board again, we know we don't have to expand it further, because we already know that it doesn't lead to a solution. In order to speed up the algorithm, we also use a set of previously seen boards, for which we know do not lead to a solution. The program iterates over those new states and recursively repeats this same procedure for each of those new states until it either finds a solution or reaches a dead-end, in which case it backtracks to previous state and tries some other move. If not, it first finds all possible new board states that can be obtained by making all available (legal) one-step moves. That is, for the initial state of the board it first checks whether it is a solution. Solution: This program uses the classic Depth first search (DFS) backtracking algorithm. Also, we want to use 2htdp/image library to write a function that graphically displays all the solution steps on the screen.

#36 PEG SOLITAIRE SOLUTION SERIES#

So, we want to write a program that finds a series of moves that we have to make so that in the end only one (central) peg remains in the puzzle. You've probably seen this puzzle somewhere before, but if you haven't, please check out this video. Problem: Problem: In this problem we will write a program that solves the Peg Solitaire puzzle.

36 peg solitaire solution