Peg Solitaire : Automated
- October 2019
- www.c-sachdeva.github.io/Peg-Solitaire (private)
Program to solve peg solitaire puzzles is implemented in C using recursion and backtracking. It is further optimized using memoization. It uses a hash-based dictionary to remember unsolvable boards. The dictionary associated to each such board has the smallest number of pegs reachable from it .