29 Mar '08 17:38

Can K+B+N win against K on a square chessboard of any size? (maybe with some exceptional small boards)

What about a quarter-infinite board? (a board which has only left and bottom border)

Is there a fast algorithm which will make the K+B+N win from any starting position in a reasonable number of moves?

What about a quarter-infinite board? (a board which has only left and bottom border)

Is there a fast algorithm which will make the K+B+N win from any starting position in a reasonable number of moves?