Marco Ripà

most citedProving the existence of Euclidean knight's tours on

n \times n \times \dots \times n

chessboards for

n < 4

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

math.CO2023★ 1 cited

Proving the existence of Euclidean knight's tours on $n \times n \times \dots \times n$ chessboards for $n < 4$

Marco Ripà

The Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set…

Proving the existence of Euclidean knight's tours on n×n×⋯×n chessboards for n<4

Proving the existence of Euclidean knight's tours on $n \times n \times \dots \times n$ chessboards for $n < 4$