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.

1, 8, 11, 14, 5, 2, 9, 4, 7, 12, 3, 6, 55, 32, 13, 10, 31, 16, 19, 22, 25, 18, 15

Offset: 1

Author

Gabriel Stauth, Jun 07 2019

Keywords

• nonn
• fini
• full

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).

Crossrefs

A316667 and A316588 inspired the idea.