Jianying Ji wrote on Fri, May 10, 2002 04:14 PM UTC:
Thinking about it, let me restate my question in the form of 2
challenges:
Construct the shortest possible fool's mate for the following variant:
FIDE chess without pawns nor castling.
Then construct the shortest possible computer's mate (named after early
chess computer programs), by which I mean that it will respond to
any possible mate within 3 moves. Or another way to say it is
construct the shortest game that leads to a win in 4 moves.
