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
• @article@Knights Tour Problem
• @article@Backtracking: The Knight’s Tour Problem