Year: 1994
Type: preprint
Abstract: An $\{r,s\}$-leaper is a generalized knight that can jump from $(x,y)$ to $(x\pm r,y\pm s)$ or $(x\pm s,y\pm r)$ on a rectangular grid. The graph of an $\{r,s\}$-leaper on an $m\times n$ board is the set of $mn$~vertices $(x,y)$ for $0\leq x
Source: arXiv (Cornell University)
Author: Knuth, Donald E.
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4394639889