There are four knights on a 3 x 3 chessboard. The two white knights are at the two bottom corners, and the two black knights are at the upper two corners of the board. Find the shortest sequence of moves to achieve the final position as shown in the figure or prove that no such sequence exists.
A knight in a game of chess has L-shaped moves. So, it can occupy at most two different positions in a single move on a 3 x 3 board. Consider a graph where vertices represent the cell number and the edges between them represent, the moves that various knights can make.
In this graph, we have two knights of the black color, followed by two knights of white color. Let’s consider knight at cell 1 moves to cell 6. Now to move to its final position cell 7, the knight at cell 7 should move to cell 2. However, its final position is cell 1 as shown. So the asked configuration is impossible to achieve. This is true for any sequence of moves, whether clockwise or counter-clockwise, as the ordering of the knights remains the same. However, the final configuration in question demands an alternating colored sequence of knights. So, this puzzle has no solution.
- Puzzle | Four Glasses and Blindfold
- Four People on a Rickety Bridge
- Puzzle 24 | (10 Coins Puzzle)
- Puzzle 27 | (Hourglasses Puzzle)
- Puzzle 28 | (Newspaper Puzzle)
- Puzzle 29 | (Car Wheel Puzzle)
- Puzzle 31 | (Minimum cut Puzzle)
- Puzzle 33 | ( Rs 500 Note Puzzle )
- Puzzle 34 | (Prisoner and Policeman Puzzle)
- Puzzle 36 | (Matchstick Puzzle)
- Puzzle 38 | (Tic Tac Toe Puzzle)
- Puzzle 39 | (100 coins puzzle)
- Puzzle 51| Cheryl’s Birthday Puzzle and Solution
- Puzzle 81 | 100 people in a circle with gun puzzle
- Puzzle 85 | Chain Link Puzzle
- Puzzle | Elevator Puzzle
- Puzzle | 3 Priests and 3 devils Puzzle
- Puzzle | Man fell in well Puzzle
- Puzzle 15 | (Camel and Banana Puzzle)
- Puzzle 1 | (How to Measure 45 minutes using two identical wires?)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.