# 2 bishops versus a lone king

There are 4 pieces on the board, the white and black kings, as well as 2 white bishops (on differently colored squares).

The only way a stalemate occurs is if the black king is not in check, but cannot make a move. (No threefold repetition, timer, etc.) Remaining rules are same as chess.

Assuming perfect play by both players, give the position of the board where white wins, but requires the maximum possible moves to do a checkmate.

• Wikipedia says "With the side with the bishops to move, checkmate can be forced in at most nineteen moves," so there's that Apr 9, 2015 at 20:11
• Although I answered it, it took only a couple of Google searches; plus this is not on-topic, given that humans cannot reasonably be expected to "solve it",i.e. demonstrate how a given number of moves is the best. Sorry, OP, but -1. Apr 10, 2015 at 6:42
• I'm voting to close this question as off-topic because it might be more at home on Chess.SE.
– A E
Apr 10, 2015 at 8:39
• Questions should not be put on hold because they might be more on-topic elsewhere. If they are on-topic here, we should keep them.
– user20
Apr 11, 2015 at 19:30
• @Emrakul The problem is that there is, as far as I can tell, nothing of a puzzle about this, especially given that answers suggest that OP's question in the comment above yours - 'is there a logical approach to achieving the minimal number of moves?' - has a negative answer. I think there are valid chess questions for this site, and valid optimization questions for this site, but this is neither of those. Apr 12, 2015 at 3:48