Bands: Years 11, 7-8, 9-10, 5-6, 12
Duration: 1 hour
In this activity, students must find a way for a knight to visit every square on a board exactly once. It addresses data representation, generalisation, pattern matching, graphs, computational thinking and various search algorithms.
In this activity, students must find a way for a knight to visit every square on a board exactly once. It addresses data representation, generalisation, pattern matching, graphs, computational thinking and various search algorithms.
