OFFSET
1,2
COMMENTS
This graph is the "strong product" of P_n with P_n, where P_n is a path of length n. Sequence A007764 is what we get when we restrict ourselves to rook moves of unit length.
Computed using ZDDs (ZDD = "reduced, order, zero-suppressed binary decision diagram").
REFERENCES
Donald E. Knuth, The Art of Computer Programming, Vol. 4, fascicle 1, section 7.1.4, p. 117, Addison-Wesley, 2009.
LINKS
Jens Weise, Evolutionary Many-Objective Optimisation for Pathfinding Problems, Ph. D. Dissertation, Otto von Guercke Univ., Magdeburg (Germany, 2022), see p. 53.
EXAMPLE
For example, when n=8 this is the number of ways to move a king from a1 to h8 without occupying any cell twice.
CROSSREFS
KEYWORD
nonn,walk
AUTHOR
Don Knuth, Jul 26 2008
EXTENSIONS
a(9)-a(11) from Andrew Howroyd, Apr 07 2016
STATUS
approved