Solving Triangular Peg Solitaire

Details Solving Triangular Peg Solitaire Solving Triangular Peg Solitaire

2007-03-29

arxiv.org/abs/math/0703865v6

Journal of Integer Sequences, Vol. 11 (2008), Article 08.4.8

Mathematics

Combinatorics

23 pages, 14 figures; published version including comments by John Beasley

Scientific paper

We consider the one-person game of peg solitaire on a triangular board of arbitrary size. The basic game begins from a full board with one peg missing and finishes with one peg at a specified board location. We develop necessary and sufficient conditions for this game to be solvable. For all solvable problems, we give an explicit solution algorithm. On the 15-hole board, we compare three simple solution strategies. We then consider the problem of finding solutions that minimize the number of moves (where a move is one or more consecutive jumps by the same peg), and find the shortest solution to the basic game on all triangular boards with up to 55 holes (10 holes on a side).

Affiliated with

Also associated with

No associations

Rating

Solving Triangular Peg Solitaire does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving Triangular Peg Solitaire, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Triangular Peg Solitaire will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-711245