• DOI:10.2307/3620202
Corpus ID: 16856513

Leaper graphs

@inproceedings{Knuth1994LeaperG,
  title={Leaper graphs},
  author={D. Knuth},
  year={1994}
}

D. Knuth

Published 1994

Mathematics

An {r, s}-leaper [1, p. 130; 2, p. 30; 3] is a generalized knight that can jump from (x, y) to (x±r, y±s) or (x ± s, y ± r) on a rectangular grid. The graph of an {r, s}-leaper on an m × n board is the set of mn vertices (x, y) for 0 ≤ x < m and 0 ≤ y < n, with an edge between vertices that are one {r, s}-leaper move apart. We call x the rank and y the file of board position (x, y). George P. Jelliss [4, 5] raised several interesting questions about these graphs, and established some of their… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed