ChineseCheckers__Shortest_Possible_Game__1Player_10Marbles_(27Moves).avi

This shows a 1-person Chinese Checkers game where the player tries to get their marbles to the other side as quickly as possible. It turns out that it cannot be done in fewer than 27 moves. Here is one 27-move solution, which was found by hand around 1971 by Octave Levenspiel. The solution is palindromic, it is symmetrical about the center move.

Смотрите также