Jonathan Allan - cp's OEIS frontend

User: Jonathan Allan

Jonathan Allan has authored 1 sequences.

A323763 Squares visited by gnu (A.K.A. wildebeest; (1,2)+(1,3)-leaper chess piece) moves on a spirally numbered board and moving to the lowest available unvisited square at each step.

1, 10, 3, 6, 9, 4, 7, 2, 5, 8, 11, 14, 18, 15, 12, 16, 19, 22, 41, 17, 33, 30, 34, 13, 27, 23, 20, 24, 44, 40, 21, 39, 36, 60, 31, 53, 26, 46, 25, 28, 32, 29, 51, 47, 75, 42, 45, 71, 74, 70, 38, 35, 59, 56, 86, 50, 78, 49, 52, 80, 83, 79, 115, 73, 107, 67, 64

Offset: 1

Jonathan Allan, Jan 26 2019

In fairy chess the (1,2)+(1,3)-leaper is called a Gnu. - Vaclav Kotesovec, Jan 28 2019
Board is numbered with the square spiral:
.
  17--16--15--14--13
   |               |
  18   5---4---3  12   .
   |   |       |   |
  19   6   1---2  11   .
   |   |           |
  20   7---8---9--10   .
   |
  21--22--23--24--25--26
.
This sequence is finite: At step 12899744968 square 12851850258 is visited, after which there are no unvisited squares within one move.

Wikipedia, Fairy chess piece
Wikipedia, Wildebeest Chess

Cf. A316667, A317106.

cp's OEIS Frontend

User: Jonathan Allan

A323763 Squares visited by gnu (A.K.A. wildebeest; (1,2)+(1,3)-leaper chess piece) moves on a spirally numbered board and moving to the lowest available unvisited square at each step.

Views

Author

Keywords

Comments

Links

Crossrefs