Case 4 Pow 1 The Big Knight Switch
Problem Statement
Four knights, 2 white, and 2 black are sitting on a 3x3 chessboard. The knights were really bored, since they spent all of their time sitting on the chessboard doing nothing, so they decided to try switching places so that the white knights would end up where the black knights started our and the black knights would end up where the white knights started out. To do this, the knights had to follow the following rules:
- No two chess pieces can occupy the same square at the same time
- Knights can jump or pass over each other on the way to an empty square
- The knights can only move 2 squares up (or down, or left, or right) and 1 square to the left (or right, or up, or down.) The moving combinations must be 2 up or down and 1 to the left or right. Or, 2 to the left or right and 1 up or down. Example: They can't move 2 to the left and 1 to the left. They must always move in an "L" shape.
- No two pieces can switch spots at the same time
- The knights can only move one at a time
- They must stay within the 9 squares of their 3x3 chessboard
Process
To solve this POW I read over exactly what it was asking and what the rules to solving it were. The easiest method to solve it was by using "Draw-A-Picture." I started out with drawing a 3x3 square and marking the …show more content…
For the solution to this POW I counted 16 moves for the black and white knights to switch places. I believe that my answer is the least number it would take for the knights to switch places, because I followed all of the rules and guidelines correctly, (No two chess pieces occupied any spot at the same given time, no two chess pieces switched into each others spot at the same time, the knights only moved one at a time, and they stayed within the 9 squares of the chessboard.) So, following all of the rules to this POW correctly, 16 moves would be the least number of moves it would take for the black and white knights to switch places. (Refer to the drawing on the next
Four knights, 2 white, and 2 black are sitting on a 3x3 chessboard. The knights were really bored, since they spent all of their time sitting on the chessboard doing nothing, so they decided to try switching places so that the white knights would end up where the black knights started our and the black knights would end up where the white knights started out. To do this, the knights had to follow the following rules:
- No two chess pieces can occupy the same square at the same time
- Knights can jump or pass over each other on the way to an empty square
- The knights can only move 2 squares up (or down, or left, or right) and 1 square to the left (or right, or up, or down.) The moving combinations must be 2 up or down and 1 to the left or right. Or, 2 to the left or right and 1 up or down. Example: They can't move 2 to the left and 1 to the left. They must always move in an "L" shape.
- No two pieces can switch spots at the same time
- The knights can only move one at a time
- They must stay within the 9 squares of their 3x3 chessboard
Process
To solve this POW I read over exactly what it was asking and what the rules to solving it were. The easiest method to solve it was by using "Draw-A-Picture." I started out with drawing a 3x3 square and marking the …show more content…
For the solution to this POW I counted 16 moves for the black and white knights to switch places. I believe that my answer is the least number it would take for the knights to switch places, because I followed all of the rules and guidelines correctly, (No two chess pieces occupied any spot at the same given time, no two chess pieces switched into each others spot at the same time, the knights only moved one at a time, and they stayed within the 9 squares of the chessboard.) So, following all of the rules to this POW correctly, 16 moves would be the least number of moves it would take for the black and white knights to switch places. (Refer to the drawing on the next