Question: Need to write the PYTHON programming to solve with breadth-first search and build node-arcs with python programming.

3.25. Knight's tour problem. Consider the chessboard shown in Figure 3.13. Note that some squares are shaded. We wish to determine a knight's tour, if one exists, that starts at the square designated by s and, after visiting the minimum number of squares, ends at the square designated by t. The tour must not visit any shaded square. Formulate this problem as a reachability problem on an appropriately defined graph. Figure 3.13 Chessboard. 3.25. Knight's tour problem. Consider the chessboard shown in Figure 3.13. Note that some squares are shaded. We wish to determine a knight's tour, if one exists, that starts at the square designated by s and, after visiting the minimum number of squares, ends at the square designated by t. The tour must not visit any shaded square. Formulate this problem as a reachability problem on an appropriately defined graph. Figure 3.13 Chessboard