Real World Maths Busters

The Maths Behind Everyday Life

The story, the formula and a worked example — see exactly where this maths shows up in the world around you.

Back to all stories
Games & Chance 4 min read

Chess Knight Tour Problem

Can a knight visit all 64 squares exactly once?

From any square, a knight has between 2 and 8 possible moves. The Warnsdorff heuristic picks the square with the fewest onward moves.

Counting the tours

The total number of directed open knight’s tours on an 8×8 board is 19,591,828,170,979,904.

Open tours≈1.96×1016\text{Open tours} \approx 1.96 \times 10^{16}

Warnsdorff’s rule

Always move to the square with the fewest available next moves. This greedy heuristic almost always produces a valid tour.

From a corner (2 moves available)

  1. 1

    Step

    Move to the square with fewer exits

  2. 2

    Step

    Corners and edges have fewer exits — visit them early

Answer

Warnsdorff’s rule succeeds ~99.9% of the time

The formula behind it

Combinations

(nr)=n!r!(n−r)!\binom{n}{r} = \frac{n!}{r!(n-r)!}
See the full formula, variables and more examples

The takeaway

The knight’s tour has trillions of solutions — but finding one still requires clever strategy.

Back to all stories