Peg Jumping for Fun and Profit

Details Peg Jumping for Fun and Profit Peg Jumping for Fun and Profit

2004-11-12

arxiv.org/abs/math/0411275v2

Mathematics

Combinatorics

Original: 7 pages, recreational mathematics. Replacement: 6 pages, 6 figures, conjectured lower bound proved, retitled

Scientific paper

We consider the problem of determining the minimum number of moves needed to solve a certain one-dimensional peg puzzle. Let N be a positive integer. The puzzle apparatus consists of a block with a single row of 2N+1 equally spaced holes which, apart from the central hole, are occupied by an equal number N of red and blue pegs. The object of the puzzle is to exchange the colors of the pegs by a succession of allowable moves. Allowable moves are of two types: a peg can be shifted from the hole it occupies into the empty hole adjacent to it, or a peg can jump over an adjacent peg into the empty hole. We exhibit a sequence of N^2+2N moves that solves the puzzle, and prove that no solution can employ fewer moves.

Affiliated with

Also associated with

No associations

Rating

Peg Jumping for Fun and Profit 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 Peg Jumping for Fun and Profit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Peg Jumping for Fun and Profit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-87561