Use this tag to describe mathematics questions dealing with the knight's tour problem. A knight's tour is a series of legal knight moves in chess that visits all of the squares on the board exactly once.
Questions tagged [knight-tours]
42 questions
1
vote
1 answer
What's this kind of visualization of the Knight's Tour called? Connected rectangular graphs?
What's this kind of visualization of the Knight's Tour called? Connected rectangular graphs? This is on a 6x6 chessboard.
Also, why are the rectangular regions separated like that?
And why does one get similar (3x3) rectangular areas?
mavavilj
- 7,270
0
votes
2 answers
Table-game problem that a bit looks like Knight's Tour problem
Given a table containing some instruction in each cell ($L$ - $U$ - $R$ - $D$ = Left - Up - Right - Down). The coefficient of the instruction means the number of steps (for example, $2L$ means you should move two squares to your left). The task is…
VIVID
- 11,604
0
votes
2 answers
Show that, in a chessboard it is possible to traverse to any given square from another given square using a knight.
Show that, in a chessboard it is possible to traverse to any given square from another given square using a knight.
This was asked in a high school math competition.
Rhea
- 87
0
votes
0 answers
Properties of a general knight in the knight's tour problem.
I am currently investigating how the knight's tour problem differs when a general knight (m, n) is used instead of a traditional knight (2, 1), where m represents moving a number of squares along one axis and n represents the number of squares along…
Perpenderp
- 31
0
votes
0 answers
Knight's open tour on 5X5 board
I'm trying to write a program that finds an open knight's tour on 5X5 board starting from every point. I So the question is does every point actually has a solution. I found this answer that says that there is no solution when you start at any of…
user2992672
- 101