|
Search: id:A126777
|
|
|
| A126777 |
|
Size of unconstrained level set on Diamond(5) Diagonal Peg Solitaire at level n. |
|
+0
2
|
|
| 1, 2, 12, 152, 2347, 43763, 890355, 18085322, 325165209
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Abstract: "We study the classical game of peg solitaire when diagonal jumps are allowed. We prove that on many boards, one can begin from a full board with one peg missing and finish with one peg anywhere on the board. We then consider the problem of finding solutions that minimize the number of moves (where a move is one or more jumps by the same peg) and find the shortest solution to the 'central game', which begins and ends at the center. In some cases we can prove analytically that our solutions are the shortest possible, in other cases we apply A* or bidirectional search heuristics."
|
|
LINKS
|
George I. Bell, Diagonal Peg Solitaire, 25 Jan 2007, table 1, p. 14.
|
|
CROSSREFS
|
Sequence in context: A086928 A001927 A105558 this_sequence A126345 A000795 A085628
Adjacent sequences: A126774 A126775 A126776 this_sequence A126778 A126779 A126780
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Feb 18 2007
|
|
|
Search completed in 0.002 seconds
|
