Boards

Ultimate Peg Solitaire solving algorithm is a non-deterministic heuristic-based algorithm that requires a pruning number. Allowed values of the pruning number are between 100 and 1,000. Smaller numbers result in shorter search time, but are less likely to find a solution. Larger numbers will result in much longer search time, but are more likely to find a solution. 200 is a good first guess for a pruning number that solves most easy problems. If solution is not found, pick a larger pruning number. Running the solver multiple times even with the same pruning number may possibly result in finding different solutions.

Time Out is the maximum amount of time you are willing to wait for the solver to finish looking for a solution.