Today we learnt the ancient chess problem ‘The Knights Tour’. We start with a chess board and one knight. The knight needs to visit as many squares on the board as possible but cannot visit a square twice. In total there are 64 squares that the knight needs to visit.
We had two teams, a black knight and a white knight. The black knight team got scores of 41, 51 and 53 and the white team got 51 and 49 moves.
We had to think about the best possible move each time to make sure we didn’t trap ourselves somewhere on the board without any more moves. We found the corners were the most dangerous place to play as it only left two moves where the knight could go, while if we were in the middle we had eight possible moves.
Alex – My favourite part was the end of the game when we only had a few moves left and we had to think which moves was the smartest move.
When we finished the game we needed to count how many squares we had filled. Each time we had a different strategy, the first time we counted the squares in 2’s, then we tried, 5’s, 6’s, and 10’s. We even checked our answer because we knew there were 64 squares and we had 11 squares left uncovered so we worked out that 64-11=53 and we had 53 squares covered.
Sometimes we put dominoes in the possible places we could move the knights to to work out which was the best option.