|
| |
|
|
A308562
|
|
Squares visited a knight moving on a board numbered by Hilbert's space-filling curve and moving to the lowest-numbered available unvisited square at each step.
|
|
0
|
|
|
|
1, 8, 11, 14, 5, 2, 9, 4, 7, 12, 3, 6, 55, 32, 13, 10, 31, 16, 19, 22, 25, 18, 15
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
Like the trapped knights problem (A316667 and A316588), but starting in the corner of a board numbered by Hilbert's space-filling curve.
The knight traps itself after only 22 moves (checked manually).
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,fini,full
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
