In response to peg jumping for fun and profit
In this paper we begin by considering the optimal solution to a
certain one dimensional puzzle game. The complexity of the game and
an optimal algorithm were given in a previous paper. Here, we will
show that there are only two optimal algorithms, all optimal
solutions will conform to certain criteria, and how these results
extend into alternative versions of the game.