Pesquisar
Knight's tour
01
a mathematical problem and a chess puzzle that involves finding a sequence of moves for a knight that visits every square on an empty chessboard exactly once
What is a "knight's tour"?
A knight's tour is a chess puzzle where the goal is to move the knight around the board to visit every square exactly once, without revisiting any square. The knight must follow its unique movement pattern, which forms an L-shape. There are two types of knight's tours: open, where the knight does not end on the square it started, and closed, where it finishes on the square it began, creating a continuous loop. The knight's tour is often used to study algorithms and problem-solving strategies in mathematics and computer science.
Example
He solved the knight's tour puzzle in just a few minutes, impressing his friends.
After a long day of studying, she decided to try a knight's tour for fun.
She found an online simulator where you can practice solving a knight's tour.
Palavras Próximas
