NihalPotdar/KnightsTour

The Knight's tour problem is a very complex mathematical problem that explores if a knight beginning in a particular position, can reach every square on a chess board.

This repository is not active