Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Warnsdorff's Rule

Graph Algorithm

Warnsdorff's rule is a heuristic for finding a single knight's tour on a chessboard, in which the knight is always moved to the square from which it will have the fewest onward moves. It was first described by H. C. von Warnsdorff in 1823, in an essay titled, in translation, The Simplest and Most General Solution of the Knight's Tour.

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.