The following problem appeared in The Problemist of March 1970, and was reprinted in Variant Chess, issue 1, Winter 1990.
The author of the problem is C. H. O'D. Alexander.
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
White: |
Mate in 2 means: white moves, such that he can mate black in his second move, regardless what black moved. Refusal chess means: you may refuse one of your opponents moves each turn. (However, when your king is in check, you must move him out of check: if you have only one possibility to do so, you lose. Note that this is slightly different from the rules of the original refusal chess: there you may not refuse the only legal move of a player.)
The first solution to this problem was send in by Ralph Betza.