knight's tour
复数形式
knight's tours
1
骑士巡游, 骑士之旅
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
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.
- 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.
她找到了一个在线模拟器,你可以在那里练习解决骑士之旅。
- The chess enthusiast spent hours trying to figure out a closed knight's tour.
这位国际象棋爱好者花了几个小时试图找出一个封闭的骑士巡游。