# Checkmating with two bishops

Let White have the two bishops. Given any setup, has the maximum number of moves to forced mate been calculated on an nxn board (for large enough n)? If not, are there any bounds on this number?

Of course, information on extensions of this problem to say any rectangular board, are also welcome.

I should note that for a 2xn board checkmate isn't possible. Also, for m >= 3, with n >= m without loss of generality, I'm not certain whether forced mate is always possible. I would say though that it is given m,n sufficiently large though.

To update let the bishops be on opposite colored squares, of course.

Update again: I noticed someone edited the question out. It isn't meant merely for the 8x8 board, but for any nxn board, where n is any sufficiently large natural number. I know R&K vs K has been solved in this way for any nxn board. I'm wondering whether the same has been done for K BB vs. K on any nxn board. Please watch what you edit next time. Also, an answer has been accepted to the edited question, not my intended question.

• What do you mean by "without losing generality"? Commented Jul 27, 2016 at 12:49
• In this case those words shouldn't have appeared. Commented Jul 29, 2016 at 0:23
• If you look at the edit history, you will see that nobody other than you has ever the edited the question, except for the tags. Since the question didn’t make it clear that you wanted an answer for general n×n, it’s not surprising that the existing answer got marked as accepted. Commented Aug 30, 2020 at 12:00
• I don't remember editing the question out. It certainly wasn't my intention to edit it out. Also, it should've been clear that I was talking about a generalization, and not the standard 8x8 board. I did have the variables m and n in the post, after all. Commented Aug 30, 2020 at 12:49
• @CarloWood - The results would probably might make for a good math paper somewhere. You can answer it here, but I'd probably try to publish it if I were you. Commented Mar 27, 2022 at 16:42