Solve a puzzle where you must find a way for a knight to visit every square on a board exactly once.
This activity involves trying to solve a puzzle using two different representations. To start with it is fairly hard, but when the representation of the board and moves is changed it becomes really easy. Create graphs to represent the problem. See the power of using abstraction and how the choice of representation can make a problem much easier.
This activity follows directly from the Tour Guide Activity – read that first.
- data representation
- pattern matching
- computational thinking
- graph traversal algorithms
- depth first search
- breadth first search
This session comes with linked activity sheets/booklets that you can download:
- Activity: A Knight’s Tour [PDF]
- Booklet: Computational Thinking – The Knight’s Tour [PDF]
- Video: (also about the Tour Guide Activity)
This activity can be used alone but naturally combines with the Knight’s Tour Activity.