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,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

Table of n, a(n) for n=1..23.

Crossrefs

A316667 and A316588 inspired the idea.

Sequence in context: A337491 A106670 A247463 * A254671 A265412 A372498

Adjacent sequences: A308559 A308560 A308561 * A308563 A308564 A308565

Keyword

nonn,fini,full

Author

Gabriel Stauth, Jun 07 2019

Status

approved