rachel.iik
New Member
- Joined
- Jan 15, 2020
- Messages
- 10
- Gender
- Female
- HSC
- 2021
Knights Tour
Investigate the following modified Knights Tour problem. In this investigation, you will need to know how a knight moves on a chessboard. Basically it can only move two places forward and one place left o right, just like the letter L.
If the knight starts in the Top Left square and eventually ends up in the Bottom Right square of the chessboard with the following conditions:
1. It can move in any direction (including backwards) as long as it is a legal move
2. It cannot make the same move on the board.
Calculate the total possible moves that it can make. Try and use Permutations and combinations in your solution.
Investigate the following modified Knights Tour problem. In this investigation, you will need to know how a knight moves on a chessboard. Basically it can only move two places forward and one place left o right, just like the letter L.
If the knight starts in the Top Left square and eventually ends up in the Bottom Right square of the chessboard with the following conditions:
1. It can move in any direction (including backwards) as long as it is a legal move
2. It cannot make the same move on the board.
Calculate the total possible moves that it can make. Try and use Permutations and combinations in your solution.