user24274: 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?

user14767: The longest KQQ-K mate whilst maintaining optimality is a mate in 4.
[FEN "8/8/8/3k4/8/5K2/8/4Q2Q w - - 0 1"]


24274: <p>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?</p>
 14767: <p>The longest KQQ-K mate whilst maintaining optimality is a <a href="http://www.gilith.com/chess/endgames/kqq_k.html" rel="nofollow noreferrer">mate in 4</a>.</p>
<pre><code>[FEN &quot;8/8/8/3k4/8/5K2/8/4Q2Q w - - 0 1&quot;]
</code></pre>
