Puzzling Asked on July 2, 2021
What is the least number of moves required to swap black and white queens? Queens move using standard chess rules – any number of empty cells vertically, horizontally or diagonally in a straight line. You do not need to alternate players.
Here is a similar question for rooks: Swapping 3 rooks in a 3×3 grid
It can actually be done in 17 moves.
Correct answer by Dr Xorile on July 2, 2021
Using the notation, (x = black queen, o = white queen, - = empty space), I came up with the following series of steps:
Starting Position:
x x x -
x x - o
x - o o
- o o o
1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
This is also the solution with the least number of steps.
EDIT: As noted by @Bass below, the above explanation does not always hold true. So, there could theoretically be a lower limit than the one I explained.
Answered by Alaiko on July 2, 2021
Here is another optimal one.
Not correcting for symmetries there are
A brute force program finds all of them in less than a minute.
Answered by Albert.Lang on July 2, 2021
Get help from others!
Recent Questions
Recent Answers
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP