Knight's Tour Chessboard Puzzle Quiz: Euler and Warnsdorff

IQ & Logic Quizzes By 10 questions · 150 sec

One knight, 64 squares and no square visited twice, the knight's tour chessboard puzzle quiz explores one of the oldest problems in recreational mathematics. Play 10 interactive questions on the knight's L-shaped move, open and closed tours, Leonhard Euler, Warnsdorff's rule, color switching, odd-sized boards, the 4x4 board, the Mechanical Turk and computer searches.

Advertisement

Start Knight's Tour Chessboard Puzzle Quiz

🎯 Daily Trivia Challenge • 🧠 10 Questions • ⏱️ 150 Seconds

Question 1 / 10 Time: 150s
  1. Goal

    What is the goal of a knight's tour?

  2. Move

    How does a chess knight move?

  3. Closed

    What makes a knight's tour closed?

  4. Euler

    Which famous mathematician studied the knight's tour in 1759?

  5. Rule

    What does Warnsdorff's rule tell you to do?

  6. Color

    What happens to the knight's square color on every move?

  7. Odd

    Why is a closed tour impossible on a 5x5 board?

  8. Four

    What is true of the 4x4 board?

  9. Turk

    Which famous chess automaton performed the knight's tour for audiences?

  10. Count

    How many squares does a knight visit in a full tour on a standard board?

Explanations: answer key for all 10 questions
  1. Q1: What is the goal of a knight's tour?

    Answer: To visit every square exactly once

    The knight moves only by its normal chess rules. No square may be visited twice.

  2. Q2: How does a chess knight move?

    Answer: In an L shape

    It goes two squares one way and one square sideways. It can also jump over pieces.

  3. Q3: What makes a knight's tour closed?

    Answer: The last square is one knight's move from the first

    A closed tour can loop back to the start. It is also called a re-entrant tour.

  4. Q4: Which famous mathematician studied the knight's tour in 1759?

    Answer: Leonhard Euler

    He wrote a paper describing methods for finding tours. He worked on many puzzles of this kind.

  5. Q5: What does Warnsdorff's rule tell you to do?

    Answer: Move to the square with the fewest onward moves

    Visiting hard-to-reach squares early avoids getting stuck. The rule dates from 1823. H. C. von Warnsdorff described this simple and effective method.

  6. Q6: What happens to the knight's square color on every move?

    Answer: It changes to the opposite color

    A knight always lands on a different color. This simple fact helps prove many results.

  7. Q7: Why is a closed tour impossible on a 5x5 board?

    Answer: It has an odd number of squares

    A closed tour must use equal numbers of each color. With 25 squares that is impossible.

  8. Q8: What is true of the 4x4 board?

    Answer: No knight's tour of any kind exists on it

    The board is too cramped for the knight. Some squares cannot be reached properly in order.

  9. Q9: Which famous chess automaton performed the knight's tour for audiences?

    Answer: The Mechanical Turk

    It toured Europe in the late 1700s and early 1800s. A hidden human player operated it.

  10. Q10: How many squares does a knight visit in a full tour on a standard board?

    Answer: 64

    Every square of the 8x8 board is used once. The knight makes 63 moves to finish.

Advertisement

A Knight on Every Square

A knight's tour visits every square exactly once using the knight's L-shaped move. In a closed tour the last square is one move from the first. Leonhard Euler studied the puzzle in 1759, and Warnsdorff's rule of 1823 says to move to the square with the fewest onward moves.

Because the knight changes color on every move, a closed tour is impossible on boards with an odd number of squares, such as 5x5. No tour exists on a 4x4 board, and the Mechanical Turk performed the puzzle for audiences.

What This Quiz Teaches

Puzzle fans will enjoy these questions.

  • What a knight's tour is
  • Who studied it
  • Which rules help
  • Which boards have no tours
  • Who performed it

Did You Know?

  • Knight's tours can be used to make magic squares.
  • Computers can find tours very quickly.
  • Some poets used tours to order verses.
  • The puzzle is many centuries old.
  • Tours also exist on rectangular boards.

Related Quizzes

Advertisement

Ready for another round?

Jump to a random quiz from the archive.

Random quiz

Keep playing