Pow # 9
Problem Statement There are certain moves that a knight is able to do on a chessboard. As shown below those are the moves it is able to do. As stated in the game chess two chess pieces aren't allowed to be in the same place you may pass or jump over pieces on your way to an empty space. There are two black knights and two white knights that decided to switch places so that the black knights would be where the white knights where and so the white knights are where the black knights were on a 3 by 3 board. Can they do it? If yes what is the least number of moves and how do you know its the least? If its not possible explain why not? Process: For my process I started off with drawing of a 3 by 3 grid. Seeing possible ways to make sure I am filling the steps. I did want to give up many times but I kept doing possible outcomes. After that I did ask for help but everything confused me until I saw that if you keep moving the pieces one by one clock wise and keep ,moving them and eventually the two sides will flip and counting your moves I got 16. Solution: What I got was 16 because counting my moves and moving clock wise got me that. Evaluation: Knowing from my previous pow I didn't like this one very much it made me think very hard and sometimes I learn better when I think a lot and get into and take it in than just think so much and ant to give up a lot. |