[Retros] Precisions about Checkless Chess tourney

Noam Elkies elkies at math.harvard.edu
Sat May 26 11:13:58 EDT 2012

"Andrew Buchanan" <andrew at anselan.com> writes:

> In Hochberg's "Outrageous Chess Problems" I think there is a checkless

> problem involving a couple of nightriders, but I can't remember the

> details.

I don't either, but it's probably something like Kd3,Rd2,Rh2/Ke5,Nc7,Nf7,
producing the conundrum of whether Rh2-e2 is checkmate or an illegal move.


More information about the Retros mailing list