pose? Can our algorithms be adapted to suit? Finally, can we devise a program solution to the simpler problems to help us deal with related problems with increasing complexity of counting? Will the extended problems be too complex for our human solutions? Logic. Can we use logic to argue once we choose a first move from Square 1 to either 6, 7 or 9, whether this has consequences for the final move (if one exists?) from 6, 7 or 9 on the final move back to 1? Creativity. Can we find other ways to look at this problem other than the board on which it is played --- experiment with other representations of the problem? Figure 2(a). Knight’s 4-closed tour from square 1. Figure 2(b). Knight’s 6-closed tour from square 1. We first look at a number of head on human approaches to the simple knight’s tour. We can tackle the reduced problem of say a 2, 3, 4, 5… knight moves closed tour… with a made up board, a make-do knight, and pen and paper to record our moves. Or use the KT_App1 (download latest version from www.ispython.com/knights-tour/, and run as a Python 3 program), shown in Figure 1, designed to facilitate the process of constructing and recording a trail of legitimate knight moves on the board.
pose? Can our algorithms be adapted to suit? Finally, can we devise a program solution to the simpler problems to help us deal with related problems with increasing complexity of counting? Will the extended problems be too complex for our human solutions? Logic. Can we use logic to argue once we choose a first move from Square 1 to either 6, 7 or 9, whether this has consequences for the final move (if one exists?) from 6, 7 or 9 on the final move back to 1? Creativity. Can we find other ways to look at this problem other than the board on which it is played --- experiment with other representations of the problem? Figure 2(a). Knight’s 4-closed tour from square 1. Figure 2(b). Knight’s 6-closed tour from square 1. We first look at a number of head on human approaches to the simple knight’s tour. We can tackle the reduced problem of say a 2, 3, 4, 5… knight moves closed tour… with a made up board, a make-do knight, and pen and paper to record our moves. Or use the KT_App1 (download latest version from www.ispython.com/knights-tour/, and run as a Python 3 program), shown in Figure 1, designed to facilitate the process of constructing and recording a trail of legitimate knight moves on the board.