Depth First Search — Problem Solving with Algorithms and Data Structures
Implementing Knight’s Tour The search algorithm we will use to solve the knight’s tour problem is called depth first search (DFS). Whereas the breadth first search algorithm discussed in the previous section builds a search tree one level at a time, a dep...