Knight Graphs: Structure, Tours, and Complexity

• Knight graphs are defined by chessboard cells as vertices and knight moves as edges, serving as the framework for modeling knight's tours and magic tours.
• They exhibit intricate structures with distinct properties such as bipartiteness, Hamiltonicity, and various constrained labelings across standard and irregular boards.
• Extensions to higher dimensions link knight graphs to generalized leaper graphs, highlighting both constructive Hamiltonian results on regular boards and NP-hard complexities on boards with holes.

A knight graph is the graph obtained by taking chessboard cells as vertices and legal knight moves as edges. In its most common form, the graph is defined on an $m\times n$ rectangular board, but the same construction applies to any finite set of cells $S\subset \mathbb{Z}^2$, to boards with holes, and to higher-dimensional rectangular boards. Across these settings, knight graphs serve as the standard graph-theoretic model for knight’s tours, magic tours, induced-path extremal problems, generalized leaper graphs, and computational hardness questions (Beluhov, 2021, Golenia et al., 2012, Siegel, 28 Jun 2026).

1. Definition and basic structure

On a rectangular board, a cell is indexed by coordinates, and two cells are adjacent precisely when a knight can move between them in one move: $\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$ In the notation of Awani Kumar, the knight graph on an $m\times n$ board is $K_{m,n}$, with vertex set

$V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$

and edge set consisting of unordered pairs of squares related by a single knight move (Kumar, 2018). In the notation used for arbitrary finite cell sets, the knight graph on $S\subset \mathbb{Z}^2$ is $G\{S\}$, a simple graph with vertex set $S$ and the same adjacency rule (Beluhov, 2023). For boards with holes, a chessboard is modeled by a Boolean matrix $B\in\{0,1\}^{n\times n}$, the present cells form $S\subset \mathbb{Z}^2$0, and the knight graph is the simple undirected bipartite graph on $S\subset \mathbb{Z}^2$1 induced by knight moves (Siegel, 28 Jun 2026).

Knight graphs are bipartite. On ordinary boards this is the familiar checkerboard coloring: a knight move always switches the parity of $S\subset \mathbb{Z}^2$2, so every edge goes between opposite color classes (Beluhov, 2021, Beluhov, 2023). On finite rectangular boards they are sparse, with degree at most $S\subset \mathbb{Z}^2$3; internal vertices typically have degree $S\subset \mathbb{Z}^2$4, $S\subset \mathbb{Z}^2$5, or $S\subset \mathbb{Z}^2$6 depending on proximity to the boundary (Kumar, 2018).

Several minimal-board thresholds are known exactly. For the knight $S\subset \mathbb{Z}^2$7, the complete leaper graph is nontrivially connected if and only if the board contains a $S\subset \mathbb{Z}^2$8 rectangle or its transpose $S\subset \mathbb{Z}^2$9. A distinct threshold governs edge connectedness: all knight edges lie in one connected component if and only if the board contains a $\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$0 region (Beluhov, 2021). These criteria separate vertex-level connectivity from the weaker requirement that all non-isolated vertices belong to a single component.

A common misconception is that knight graphs are primarily about full rectangular chessboards. The literature treats those boards as a foundational case, but the same graph model extends directly to irregular shapes, holes, arbitrary finite cell sets, and higher-dimensional products. This broader viewpoint is essential for both the structural and the complexity-theoretic results.

2. Tours, Hamiltonicity, and arithmetic labelings

In graph-theoretic terms, a knight’s tour is a Hamiltonian traversal of the knight graph. An open tour is a Hamiltonian path, and a closed or re-entrant tour is a Hamiltonian cycle (Kumar, 2018, Siegel, 28 Jun 2026). This translation makes standard graph-theoretic distinctions central: existence of a tour becomes Hamiltonicity, and additional arithmetic constraints become constraints on vertex labelings induced by Hamiltonian paths or cycles.

Awani Kumar studies $\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$1 and $\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$2 with magic, semi-magic, quasi-magic, and near-magic constraints. On a $\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$3 board, a knight tour labels squares by $\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$4, and a magic knight tour requires all four long rows to sum to

$\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$5

while all $\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$6 short rows sum to

$\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$7

On a $\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$8 board, the corresponding constants are

$\{|x'-x''|,\;|y'-y''|\}=\{1,2\}.$9

The parity obstruction is explicit: for $m\times n$0 and $m\times n$1, magic tours are impossible if $m\times n$2 is odd, and on $m\times n$3 they are also impossible when both sides are singly even, such as $m\times n$4, $m\times n$5, and $m\times n$6 (Kumar, 2018).

The constructive existence results are specific. Magic tours exist on all boards of size $m\times n$7 for $m\times n$8, so the smallest such board is $m\times n$9. Kumar reports $K_{m,n}$0 magic tours on $K_{m,n}$1, $K_{m,n}$2 on $K_{m,n}$3, $K_{m,n}$4 on $K_{m,n}$5, $K_{m,n}$6 on $K_{m,n}$7, $K_{m,n}$8 on $K_{m,n}$9, and $V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$0 on $V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$1. For $V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$2, magic tours exist on all boards of size $V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$3 for $V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$4, so the smallest such board is $V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$5; Kumar reports $V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$6 magic tours on $V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$7. The same paper records a quasi-magic tour on $V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$8, $V(K_{m,n})=\{(i,j):1\le i\le m,\;1\le j\le n\},$9 semi-magic tours with short rows magic on $S\subset \mathbb{Z}^2$0, and on $S\subset \mathbb{Z}^2$1 it records $S\subset \mathbb{Z}^2$2 semi-magic tours with short rows magic, $S\subset \mathbb{Z}^2$3 quasi-magic tours with short-row magic, and $S\subset \mathbb{Z}^2$4 near-magic tours with short-row magic (Kumar, 2018).

The taxonomy is precise. A semi-magic knight tour requires either all long rows or all short rows to share a common sum, but not necessarily both. A quasi-magic knight tour is a semi-magic tour in which the non-magic lines take only two different sum values. A near-magic knight tour is a semi-magic tour where the non-magic lines take three distinct values: the magic constant and two other values (Kumar, 2018). Graph-theoretically, these are Hamiltonian paths or cycles together with constrained labelings on the vertex set.

Closed-tour behavior is subtler than open-tour behavior. Kumar cites Sainte-Marie’s result that closed tours are impossible on $S\subset \mathbb{Z}^2$5 boards, which is a statement that $S\subset \mathbb{Z}^2$6 admits Hamiltonian paths but not Hamiltonian cycles (Kumar, 2018). This sharp distinction between path-Hamiltonicity and cycle-Hamiltonicity recurs throughout the subject.

The enumerative results also delimit current knowledge. Kumar notes that total numbers of all tours on many boards remain unknown, records only partial or conjectural values for some sizes, and highlights open questions concerning counting complexity, the possible nonexistence of quasi-magic tours on $S\subset \mathbb{Z}^2$7, and the existence of closed magic tours on $S\subset \mathbb{Z}^2$8 and larger even boards (Kumar, 2018). This suggests that arithmetic constraints transform an already difficult Hamiltonian problem into a substantially narrower and more rigid labeling problem.

3. Knight graphs within leaper-graph theory

The knight is the $S\subset \mathbb{Z}^2$9-leaper. More generally, a $G\{S\}$0-leaper moves between cells when

$G\{S\}$1

Beluhov studies skew free leapers, meaning $G\{S\}$2, $G\{S\}$3, $G\{S\}$4, and the complete leaper graph on $G\{S\}$5 is connected. Classically,

$G\{S\}$6

The knight satisfies these conditions and is therefore the root of an infinite ternary tree $G\{S\}$7 whose vertices are all skew free leapers (Beluhov, 2021).

The three child transformations are

$G\{S\}$8

Every skew free leaper appears exactly once in the rooted tree, and each leaper has a unique descent, a word over $G\{S\}$9 describing how it is reached from the knight. Beluhov’s “induction on descent” proves general theorems for all skew free leapers by starting from the knight and propagating properties along these transformations (Beluhov, 2021).

For knight graphs themselves, several consequences are explicit. The knight graph is nontrivially connected if and only if the board contains a $S$0 or $S$1 subboard. All edges of the knight graph lie in one connected component if and only if the board contains a $S$2 subboard. A knight wazir journey, meaning a knight walk whose endpoints are adjacent by a wazir move, exists if and only if the board contains a $S$3 rectangle (Beluhov, 2021). These thresholds are minimal-board criteria rather than asymptotic statements.

Beluhov also introduces directional rigidity. Two leaper graphs are direction-isomorphic if there is an isomorphism preserving move directions. A knight graph is directionally flexible if it is direction-isomorphic to a graph of some non-proportional leaper, and directionally rigid otherwise. The criterion is the presence of an unbalanced closed walk. For the knight, Beluhov’s theorem implies that there are finitely many minimal boards $S$4 such that any board containing one of them yields a directionally rigid knight graph; on smaller boards, directionally flexible coincidences with other leapers can occur (Beluhov, 2021). The paper gives concrete descendants of the knight in $S$5, including the giraffe $S$6, the zebra $S$7, and $S$8.

The resulting perspective treats the knight graph not as an isolated chess construction but as the foundational case in a larger hierarchy of leaper graphs. This suggests a methodological shift: many apparently knight-specific phenomena are better understood as instances of structural statements that can be lifted and lowered along $S$9.

4. Induced paths, cycles, and pseudosnake density

A snake path in a graph is a path that is also an induced subgraph; equivalently, it is a chordless path. A snake cycle is an induced cycle. Beluhov studies the longest snake paths and cycles in knight graphs $B\in\{0,1\}^{n\times n}$0 and proves the asymptotic theorem

$B\in\{0,1\}^{n\times n}$1

for all positive integers $B\in\{0,1\}^{n\times n}$2 (Beluhov, 2023). Thus the longest induced path or cycle uses about half the board, with a deficit linear in the perimeter.

The upper bound is obtained through weighted pseudosnake density. A pseudosnake is an induced subgraph of maximum degree $B\in\{0,1\}^{n\times n}$3, hence a disjoint union of paths and cycles. Beluhov constructs a finite weighted knight graph on $B\in\{0,1\}^{n\times n}$4 cells with total weight $B\in\{0,1\}^{n\times n}$5 and, using a constraint-satisfaction solver (Copris, OR-Tools), verifies that the maximum total weight of any pseudosnake is exactly $B\in\{0,1\}^{n\times n}$6. The resulting weighted pseudosnake density is therefore

$B\in\{0,1\}^{n\times n}$7

A transfer lemma then yields the global upper bound $B\in\{0,1\}^{n\times n}$8 for all rectangular knight graphs (Beluhov, 2023).

The local obstruction underlying this construction is a $B\in\{0,1\}^{n\times n}$9-cell set $S\subset \mathbb{Z}^2$00 whose knight graph is isomorphic to the $S\subset \mathbb{Z}^2$01-dimensional hypercube $S\subset \mathbb{Z}^2$02. The pseudosnake density of this tesseract graph is $S\subset \mathbb{Z}^2$03, which is too large for the desired bound, so Beluhov superposes overlapping copies and obtains a weighted “pancake” graph of density $S\subset \mathbb{Z}^2$04 (Beluhov, 2023). This is an instance where the decisive obstruction is weighted rather than purely unweighted.

The lower bound comes from explicit induced-cycle constructions built from twines, ties, splices, and skeins. A twine is a board of height $S\subset \mathbb{Z}^2$05; its knight graph decomposes into four paths. By tying off twines on the left or right and splicing successive twines, Beluhov constructs sets $S\subset \mathbb{Z}^2$06 whose knight graph is a cycle whenever $S\subset \mathbb{Z}^2$07 is odd. Assemblies of four large skeins, followed by local deletion and addition operations, produce a single snake cycle occupying

$S\subset \mathbb{Z}^2$08

vertices (Beluhov, 2023).

The asymptotic theorem sharply separates ordinary Hamiltonian behavior from induced Hamiltonian behavior. Knight graphs on many large rectangles admit Hamiltonian paths or cycles, yet induced Hamiltonian paths or cycles do not exist for large knight graphs. On the $S\subset \mathbb{Z}^2$09 board, the exact extremal values cited by Beluhov are a snake path of maximum length $S\subset \mathbb{Z}^2$10 and a snake cycle of maximum length $S\subset \mathbb{Z}^2$11; Dawson found a snake path of length $S\subset \mathbb{Z}^2$12 and a snake cycle of length $S\subset \mathbb{Z}^2$13, while Knuth determined the finer equivalence-class counts (Beluhov, 2023). This shows that local nonadjacency constraints fundamentally limit induced traversals even when global tours exist.

5. Higher-dimensional knight graphs

The higher-dimensional knight graph is defined on the rectangular board

$S\subset \mathbb{Z}^2$14

where $S\subset \mathbb{Z}^2$15. The move set is

$S\subset \mathbb{Z}^2$16

so exactly two coordinates change, by $S\subset \mathbb{Z}^2$17 and $S\subset \mathbb{Z}^2$18, and the others stay fixed. The knight graph is $S\subset \mathbb{Z}^2$19, where $S\subset \mathbb{Z}^2$20 iff $S\subset \mathbb{Z}^2$21 (Golenia et al., 2012).

A closed knight tour is exactly a Hamiltonian cycle in $S\subset \mathbb{Z}^2$22. For $S\subset \mathbb{Z}^2$23, the relevant background theorem is Schwenk’s classification of rectangular boards with no closed tour: $S\subset \mathbb{Z}^2$24 and $S\subset \mathbb{Z}^2$25 both odd, $S\subset \mathbb{Z}^2$26, or $S\subset \mathbb{Z}^2$27 with $S\subset \mathbb{Z}^2$28. For $S\subset \mathbb{Z}^2$29, DeMaio and Mathew showed that no closed tour exists exactly when $S\subset \mathbb{Z}^2$30 are all odd, or $S\subset \mathbb{Z}^2$31, or $S\subset \mathbb{Z}^2$32 and $S\subset \mathbb{Z}^2$33 (Golenia et al., 2012).

Erde, Golénia, and Golénia extend this to all $S\subset \mathbb{Z}^2$34. If $S\subset \mathbb{Z}^2$35, then the $S\subset \mathbb{Z}^2$36 board has no closed knight tour if and only if one of the following holds: all $S\subset \mathbb{Z}^2$37 are odd, $S\subset \mathbb{Z}^2$38, or $S\subset \mathbb{Z}^2$39. In all other cases, the higher-dimensional knight graph has a Hamiltonian cycle (Golenia et al., 2012). They also prove that when some $S\subset \mathbb{Z}^2$40 is even, a closed tour exists if and only if the knight graph is connected.

The proof is constructive and inductive. The graph is first shown to be bipartite by a coloring $S\subset \mathbb{Z}^2$41. Nonexistence in the forbidden cases follows from parity or disconnection. Existence is proved using sites and bi-sited Hamiltonian cycles: local patterns inside a Hamiltonian cycle of a lower-dimensional knight graph allow one to glue together multiple layers and gain a new dimension while preserving Hamiltonicity (Golenia et al., 2012). This dimension-raising mechanism is the higher-dimensional analogue of building larger tours from smaller templates.

The same paper also defines generalized knight graphs $S\subset \mathbb{Z}^2$42, where the move is $S\subset \mathbb{Z}^2$43 in exactly two coordinates, and proves a dimension-raising theorem for these generalized leapers: if an $S\subset \mathbb{Z}^2$44-tour exists on a sufficiently large $S\subset \mathbb{Z}^2$45-dimensional board, then tours exist on higher-dimensional boards with dimensions at least $S\subset \mathbb{Z}^2$46 in the added coordinates (Golenia et al., 2012). This suggests that the higher-dimensional knight graph is one point in a broader family of leaper graphs whose Hamiltonicity can be propagated across dimension.

6. Complexity and algorithmic regimes

For boards with holes, the computational picture changes abruptly. A chessboard with holes is given by a Boolean matrix $S\subset \mathbb{Z}^2$47, and it is connected when the rook-adjacency graph on its present squares is connected. In this setting, the knight graph remains bipartite, but its shape can encode much more complicated structures than rectangular boards permit (Siegel, 28 Jun 2026).

The open Knight’s Tour problem is Hamiltonian path on the knight graph, and the closed Knight’s Tour problem is Hamiltonian cycle on the knight graph. On connected chessboards with holes, both open and closed Knight’s Tour are NP-hard. The reductions start from Hamiltonian path or cycle in grid graphs and replace each grid-graph vertex by a local $S\subset \mathbb{Z}^2$48 board-with-holes gadget $S\subset \mathbb{Z}^2$49. The gadgets have transition squares, the number and placement of which encode the vertex degree, and the global placement ensures that neighboring gadgets are connected by exactly one knight edge while non-neighboring gadgets are not connected by knight moves (Siegel, 28 Jun 2026).

The reverse direction of the reduction depends on parity inside the gadgets. In each $S\subset \mathbb{Z}^2$50, the total number of squares of the majority color exceeds the other by exactly $S\subset \mathbb{Z}^2$51, and all transition squares have the same color. Since a knight alternates color on every move, a global tour can enter and leave each gadget at most once. The contiguous gadget blocks extracted from a knight tour therefore recover a Hamiltonian cycle or path in the source grid graph (Siegel, 28 Jun 2026). This makes the hardness argument genuinely graph-theoretic rather than merely geometric.

The same paper places Knight Exchange in the language of pebble motion. A configuration on a graph $S\subset \mathbb{Z}^2$52 is a function

$S\subset \mathbb{Z}^2$53

with $S\subset \mathbb{Z}^2$54 and $S\subset \mathbb{Z}^2$55 representing black and white pebbles and $S\subset \mathbb{Z}^2$56 a hole. A move $S\subset \mathbb{Z}^2$57 slides a pebble along an edge into a hole. The optimal Knight Exchange problem is the corresponding Pebble Swap problem restricted to knight graphs of connected boards, with symmetric initial and final configurations. The paper proves that Pebble Swap on bipartite graphs is NP-hard and then transfers the reduction to knight graphs, concluding that the optimal Knight Exchange problem on connected chessboards is NP-hard (Siegel, 28 Jun 2026).

This hardness result coexists with a markedly easier rectangular regime. For standard rectangular boards, the decision problem for an open knight’s tour is effectively constant-time decidable from arithmetic conditions on the dimensions, and a linear-time construction is known when a tour exists (Siegel, 28 Jun 2026). A plausible implication is that knight graphs exhibit two sharply separated algorithmic behaviors: highly regular rectangles admit explicit structure theorems, while connected boards with holes are expressive enough to simulate NP-hard Hamiltonian and reconfiguration problems.

The complexity results also correct a common oversimplification. Connectivity of the underlying board does not make the problem easy: even under rook-connectivity, knight-graph Hamiltonicity remains NP-hard on boards with holes (Siegel, 28 Jun 2026). The decisive structural variable is not connectivity alone, but the extent to which the board geometry constrains the knight graph from encoding arbitrary gadgetry.