Knight's Tour Problem

Task

Move a knight on a chess board so that it visits every square exactly once. The knight moves in an L-shape: 2 squares in one direction and 1 square perpendicular, or 1 square in one direction and 2 squares perpendicular.

Configuration

Board Size (8x8)

858

ABCDEFGH87654321

Algorithm Simulations

Reset AllPlay AllPause All

Animation Speed (ms)

1000101000

Select Algorithm