Beeler and Hoilman generalized the game of peg solitaire to arbitrary connected graphs. Since then peg solitaire has
been considered on quite a few classes of graphs. Beeler and Gray introduced the natural idea of adding edges to make an unsolvable graph solvable.