On the board, there are 2 queens (of the same color) placed on random squares. The opposing side has only a king, placed on a random square (and not in check). There obviously exists a mating sequence. What is the biggest possible 'n' such that there is a forced Mate in 'n'? In other words, given the above situation, what is the upper bound on the minimum number of moves required to give a checkmate?
-
I don't have an answer to your question but I have a comment that may be relevant to your research. This link has mate in 2 puzzles with two queens vs a lone king: apronus.com/chess/puzzles/mate-in-2/?KQQvK – DrCapablasker Aug 9 at 10:37
-
1"There obviously exists a mating sequence." Except for stalemates. – TheSimpliFire Aug 9 at 12:41
-
1@TheSimpliFire The solution to that is not to stalemate. – Studoku Aug 10 at 1:58
-
2@You'rebadandshouldfeelbad I think the stalemate comment was intended to point out the possibility that the "random" starting position in the question might be stalemate. – Andreas Blass Aug 11 at 3:54
The longest K + Q + Q vs K mate whilst maintaining optimality is a mate in 4.
-
1
-
3
-
1
