login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A329518 Squares visited by a knight moving on a square-spiral numbered board where the knight moves to an unvisited square with the lowest spiral number and with seven or fewer visited neighbors. It only moves to squares with eight visited neighbors when no other square is available. 4
1, 10, 3, 6, 9, 4, 7, 2, 5, 8, 11, 14, 29, 32, 15, 12, 27, 24, 45, 20, 23, 44, 41, 18, 35, 38, 19, 16, 33, 30, 53, 26, 47, 22, 43, 70, 21, 40, 17, 34, 13, 28, 25, 46, 75, 42, 69, 104, 37, 62, 95, 58, 55, 86, 51, 48, 77, 114, 73, 108, 151, 68, 103, 64, 67, 36 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

This is a variation of A316667. The same knight move rules apply, but the knight will not move to a square which will result in it being trapped (the square will have eight visited surrounding neighbors) unless no other squares are available. If the only squares available will all result in the knight being trapped it will choose the one with the lowest board spiral number.

The sequence is finite. After 23014 steps the square with spiral number 25809 is reached after which all surrounding squares have been visited. This is the third largest possible path using the given knight-leap rules for the eight possible values of visited neighbor count. A329520 gives the other path lengths.

The sequences matches the values of A316667 for the first 2015 terms, but on the 2015th step the knight sees that square 2084 will result in it being trapped and thus chooses square 2668 instead. Along its path the knight encounters sixteen squares where it would be trapped if it had chosen the smallest numbered available square. These occurs after steps 2015, 2983, 3116, 3372, 7485, 8775, 9726, 10971, 11845, 11918, 12140, 18477, 18706, 19921, 22223, 23014. The corresponding board numbers which were rejected are given by the first fifteen values of A323714. On step 23014 there is only one square available which is it forced to move to, resulting in it being trapped on square 25809, the sixteenth entry of A323714.

LINKS

Scott R. Shannon, Table of n, a(n) for n = 1..23015

Scott R. Shannon, Image showing the 23104 steps of the knight's path. The start square is shown in green and the final square in red. All squares where the knight would have been trapped if it had chosen the lowest numbered available square are shown in yellow, along with the number of steps completed. The square it rejected at that point is shown in gray, and eight purple squares are shown around these rejected squares to show the square would have resulted in trapping. The second last square is also surrounded by eight pink squares showing that the only available square at that point was the final square which it was thus forced to move to. The final square, on the edge at about the 7 o'clock position, is surrounded by its eight blocking squares in blue.

N. J. A. Sloane and Brady Haran, The Trapped Knight, Numberphile video (2019).

EXAMPLE

See A316667 for the spiral board numbering.

CROSSREFS

Cf. A316667, A323714, A329519, A329520.

Sequence in context: A182493 A323763 A316667 * A329519 A323808 A330189

Adjacent sequences:  A329515 A329516 A329517 * A329519 A329520 A329521

KEYWORD

nonn,fini,full,walk

AUTHOR

Scott R. Shannon, Nov 18 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 30 09:24 EDT 2020. Contains 334723 sequences. (Running on oeis4.)