Peg Game Solver

The classic peg game consists of a triangular block of wood with a triangular arrangement of golf tees (pegs).
The player can only move a peg by jumping over an adjacent peg and removing the jumped peg.
The goal is to reduce the board to only one remaining peg.

This program can either perform a depth-first search or breadth-first search on the decision tree of possible moves.
A depth-first search is faster for this problem because the tree is wider than it is tall.

Visual Studio Project (.zip file)