

A332980


Squares visited by a knight moving on a quadruple spiral numbered board and moving to the lowest available unvisited square at each step.


2



1, 10, 7, 2, 8, 3, 9, 4, 6, 5, 15, 12, 38, 11, 14, 21, 32, 20, 17, 28, 39, 13, 16, 19, 30, 18, 33, 44, 56, 37, 22, 34, 23, 35, 24, 36, 25, 52, 71, 29, 40, 59, 47, 66, 31, 42, 54, 77, 89, 27, 62, 43, 55, 74, 86, 117, 70, 51, 94, 67, 48, 60, 41, 26, 65, 92, 49
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

This sequence uses a quadruple spiral of numbers to enumerate the squares on the board. The knight starts on the square with number 1. At each step the knight goes to an unvisited square with the smallest number.
The sequence is finite. After 1837 steps the square with number 1748 is visited, after which all neighboring squares have been visited.
The lowest unvisited square during the walk is square number 1211.


LINKS

Scott R. Shannon, Table of n, a(n) for n = 1..1838
Scott R. Shannon, Image showing the 1837 steps of the knights' path. The green dot is the starting square and the red dot the final square. Blue dots show the eight occupied squares surrounding the final square. The lowest unvisited square is the yellow dot.


EXAMPLE

The squares are numbered using the quadruple spiral numbering shown below:

494541373329 48
 
2622181410 25 44
   
30 1173 6 21 40
     
34 15 4 12 17 36
     
38 19 8 5913 32
   
42 23 1216202428
 
46 273135394347



CROSSREFS

Cf. A220098, A316667, A329022, A332837 (double spiral).
Sequence in context: A185221 A248153 A079166 * A246662 A246651 A089245
Adjacent sequences: A332977 A332978 A332979 * A332981 A332982 A332983


KEYWORD

nonn,walk,fini,full


AUTHOR

Scott R. Shannon, Mar 04 2020


STATUS

approved



