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?