|
|
A324273
|
|
Squares visited by a single pawn move for an even square and a double pawn move for an odd square on a diagonally numbered board and moving to the lowest available unvisited square of different parity at each step.
|
|
3
|
|
|
1, 4, 7, 2, 5, 12, 17, 8, 13, 6, 3, 10, 15, 26, 19, 32, 25, 14, 9, 18
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The board is numbered as follows:
1 2 4 7 11 16 .
3 5 8 12 17 .
6 9 13 18 .
10 14 19 .
15 20 .
21 .
.
|
|
LINKS
|
|
|
EXAMPLE
|
Square 1 is odd. Hence the next square should be the lowest even square a double move away from 1, which is square 4. Next, there is only a single option to move in a single move to an odd square, namely at square 7. Etc.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|