"The knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed, otherwise it is open.
The knight's tour problem is the mathematical problem of finding a knight's tour. Creating a program to find a knight's tour is a common problem given to computer science students.[1] Variations of the knight's tour problem involve chessboards of different sizes than the usual 8 × 8, as well as irregular (non-rectangular) boards."
The knight's tour problem is the mathematical problem of finding a knight's tour. Creating a program to find a knight's tour is a common problem given to computer science students.[1] Variations of the knight's tour problem involve chessboards of different sizes than the usual 8 × 8, as well as irregular (non-rectangular) boards."
|
Student Learning Activities
In this lesson learners will be introduced to A famous algorithm. You will look at two problems and see how abstraction can be used to model a solution and then find the solution to solve the problem. You will use the solution to aid a brave Knight who is on a quest to save a princess!
|
Lesson Resources
Teacher's Resources
| ||||||||
Click here for the KT solution explained
Homework:
Download and make one of these don't forget to create an algorithm for the method
| Gruff |