# Knight's Tour Problem

Knight's Tour Problem is a problem where we have to find a path for a knight to visit all the cells of a chessboard without visiting any cell twice.

Visit the following resources to learn more:

- [@article@Knights Tour](https://bradfieldcs.com/algos/graphs/knights-tour/)
- [@article@Knights Tour Proble](https://www.codesdope.com/course/algorithms-knights-tour-problem/)
- [@article@Backtracking: The Knight’s Tour Problem](https://www.codingninjas.com/codestudio/library/backtracking-the-knights-tour-problem)