TOPICS
Search

Fiveleaper Graph


FiveleapersTour

A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is restricted to moves that change by three squares along one axis of the board and four squares along the other or by five squares along one axis. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable fiveleaper moves are considered edges. The fiveleaper gets its name from the fact that all its move have a length of 5 squares.

The fiveleaper is similar to the hypothetical chess piece called an "antelope," but it can make an antelope's move or a rook's move of exactly 5 squares.

The plots above show the graphs corresponding to antelope graphs on n×n chessboards for n=4 to 7.

The n×n fiveleaper graph is connected for n=1 (trivially) and n>=8, Hamiltonian for n=1 (trivially) and 8, 10, 12, 14, ...(and all other even but for no odd n up to at least n=31), and traceable for n>=8 up to at least n=31 (and likely for all larger values as well).

The n×(n+1) fiveleaper graph is connected for n>=7, Hamiltonian for n=1 (trivially) and even n>=8 (up to least n=30 and likely all larger values), and traceable for n>=8 (up to at least n=29 and likely for all larger values as well).

Precomputed properties of fiveleaper graphs are implemented in the Wolfram Language as GraphData[{"Fiveleaper", {m, n}}].


See also

Antelope Graph, Camel Graph, Fairy Chess, Giraffe Graph, Knight Graph, Leaper Graph, Rook Graph, Zebra Graph

Explore with Wolfram|Alpha

References

Jelliss, G. Knight's Tour Notes. 2019. http://www.mayhematics.com/p/KTN10_Leapers.pdfMarlow, T. W. and Jelliss, G. P. "Fiveleaper Tours." May 2002. https://www.mayhematics.com/t/pf.htm.

Cite this as:

Weisstein, Eric W. "Fiveleaper Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/FiveleaperGraph.html

Subject classifications