TOPICS
Search

Antelope Graph


An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" 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. To form the graph, each chessboard square is considered a vertex, and vertices connected by allowable antelope moves are considered edges. It is therefore a (3,4)-leaper graph.

AntelopesTour

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

The n×n antelope graph is connected for n>=8, Hamiltonian for n=1 (trivially) and 14, but not for any odd n>1 or even n<=20 (other than 14). It is traceable for n=14 and 21 (with the status for n>21 unknown).

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


See also

Camel Graph, Fairy Chess, Fiveleaper Graph, Giraffe Graph, Knight Graph, Leaper Graph, Zebra Graph

Explore with Wolfram|Alpha

References

Jelliss, G. "The Big Beasts: Antelope {3, 4}." §10.36 in 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. "Antelope Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/AntelopeGraph.html

Subject classifications