🕹️ Play Canvas Knight's Tour Game: Chess Board Knights Tour Simulator for Any Sized Boards

Canvas Knight’s Tour: Open & Closed Knights Tour Chess Board is not available here.

If you want to play Canvas Knight’s Tour: Open & Closed Knights Tour Chess Board, Click here to Play

Play

Game Play Instructions

How to Play

Play Canvas Knight's Tour game online for free. Use our free simulator to conduct open or closed Knights Tours for boards of any size board. This game is rendered in mobile-friendly HTML5, so it offers cross-device gameplay. You can play it on mobile devices like Apple iPhones, Google Android powered cell phones from manufactures like Samsung, tablets like the iPad or Kindle Fire, laptops, and Windows-powered desktop computers. All game files are stored locally in your web browser cache. This game works in Apple Safari, Google Chrome, Microsoft Edge, Mozilla Firefox, Opera and other modern web browsers.

Game Controls

The game is presented as a 10×10 grid of squares. Select the 8×8 grid to simulate a chess board. The squares can be changed using the control at the top of the screen.
Click in a blank square to make the first move.
Moves can be undone using the reverse undo button at the top of the screen.
A knight moves to a square that is two squares horizontally and one square vertically, or two squares vertically and one square horizontally. Visit every square once only until you complete the entire board..

Knight’s Tour Solutions

There are two solutions to this famous chess puzzle. These solutions are known as the Closed Knight’s Tour and The Open Knight’s Tour.

The Closed Knight’s Tour are those in which the knight’s last move is one knight’s move away from the initial position. The knight’s path forms a loop whereby the knight can always go through the same path. There are 26,534,728,821,064 possible closed tours on a standard 8 by 8 playing board.
There are 19,591,828,170,979,904 possible Knight’s Tours in total.
The Open Knight’s tour is when the knight can’t reach its starting square from its final position. The knight can’t go through the same path.
Getting stuck? See the images below for a solution.

Computers can run algorithms to find knight’s tour solutions on a given board.

Brute force: only works on small boards
Divide-and-conquer: break boards into smaller component boards to solve
Warnsdorff’s rule: heuristic which moves each forward move to whichever square has the fewest remaining forward moves without revisiting an already visited square
Neural network solutions: each legal move is treated as a neuron
For more detail on the Knight’s Tour, checkout the Wikipedia entry or check out this GeeksforGeeks backtracking article..

Possible Knight’s Tour Solutions Based on Board Side

Cells Per Side	Total Squares	Open & Closed Directed Tours
1	1	1
2	4	0
3	9	0
4	16	0
5	25	1,728
6	36	6,637,920
7	49	165,575,218,320
8	64	19,591,828,170,979,904

Mobile Friendly Cross Browser Support