.I ran across this problem and tried solving this by cases. taking one knight the shortest distance then the next but kept getting lost in the count and path what is the strategy to solve these type problems? Suppose you arrange four knights on a 3-by-3 chessboard. There are white knights in the top left and top right squares, and black knights in the bottom left and bottom right squares. A knight's move is one space in any direction (horizontally or vertically) followed by two spaces in either perpendicular direction. Knights can jump over pieces in their paths, but two knights cannot simultaneously occupy the same square. Only one knight may move at a time. How many moves are required in order for the white knights to trade places with the black knights?
Last edited: