|
|
A357500
|
|
Largest number of nodes of an induced path in the n X n knight graph.
|
|
1
|
|
|
|
OFFSET
|
1,3
|
|
REFERENCES
|
Thomas Dawson, Échecs Féeriques, L'Échiquier, volume 2, issue 2, 1930; issue 3, 1931.
Donald E. Knuth, The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2, Addison-Wesley, 2023. See exercise 7.2.2.1-172 and its solution.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Longest paths for 3 <= n <= 7:
X . X . . . . . X . X . . X X X . . X . X X X . .
X . X X . X X X X . X X X . . X X X X . X . . X .
X X X . X X . X . . . X X . . . X X . X X . . X .
X X X X X X . X X X X . . . X . . X . . X X
. X X X . . X X . X X . . . . . . X
. X X X X . . X X X X X X
X X . X X . .
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|