+----+
|  1 |
+----+----+
|  2 |  3 |
+----+----+----+
|  4 |  5 |  6 |
+----+----+----+----+
|  7 |  8 |  9 | 10 |
+----+----+----+----+----+
| 11 | 12 | 13 | 14 | 15 |
+----+----+----+----+----+

The board is a fifteen cell right triangular arrangement as shown. All cells except #15 have a token. A move is a jump over a vertically, horizontally or diagonally adjacent token to an empty cell; the jumped token is removed.

The object of the game is to leave just one piece on the board. Provide a solution sequence as to how you solved the puzzle; eg 6-15, 8-10, etc.

I can get a solution set of 13 moves (in the middle game the order of sequence may differ from the solution which I have recorded.

To play this game, already constructed, go here
Note: they do not offer a solution!

(In reply to re: solution by brianjn)

Every solution, of course, has 13 moves, as it needs to eliminate 13 of the 14 pegs originally on the board. Perhaps Reges was just saying he needed 12 tries to come up with a valid set of 13.

My listing showed only every hundredth solution the program found.  Reges' was the 28,165th solution my program found, and was therefore not listed on my post, and in fact between the 281st and the 282nd shown:

(6-15)(13-6)(11-13)(3-10)(15-6)(2-9)(14-12)(6-13)(12-14)(7-2)(1-4)(4-13)(14-12)

and

(6-15)(13-6)(11-13)(3-10)(2-9)(15-6)(7-2)(14-12)(1-4)(4-13)(12-14)(6-13)(13-15)

Posted by Charlie on 2005-07-28 13:28:11