+----+
|  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!

Scanning down Charlie's post, it appears that the final ending spot for the one remaining token can be:
1, 3, 4, 7, 10, 12, 13, 15

I know we're not supposed to post new problems in these comments, but this seems related enough:

1.  I wonder if Charlie's program found any other final ending spots.
2.  And I wonder if there is any way to predict which squares can and can not be final ending spots.

Posted by Larry on 2005-07-24 19:04:39