The main goal of Knight’s Tour is to visit each tile of chessboard of size n (n > 4) only once using knight.

Example showing path for board of size 8 (8×8).

It can be achieved using Warnsdorf’s rule – in each step knight should visit tile, which has the lowest moves possible:

For n = 5 board:


Knight’s tour – Warnsdorf’s rule algorithm step by step

C++ Iteration Algorithm Python Iteration Algorithm Unity3D Visualisation
Knight’s Tour Algorithm
Tagged on:

Leave a Reply

Your email address will not be published. Required fields are marked *

This website stores some user agent data. These data are used to provide a more personalized experience and to track your whereabouts around our website in compliance with the European General Data Protection Regulation. If you decide to opt-out of any future tracking, a cookie will be set up in your browser to remember this choice for one year. I Agree, Deny