"414","A Tough Nut for Proof Procedures","It is well known to be impossible to tile with dominoes a checkerboard with two opposite corners deleted. This fact is readily stated in the first order predicate calculus, but the usual proof which involves a parity and counting argument does not readily translate into predicate calculus. We conjecture that this problem will be very difficult for programmed proof procedures,.","http://cogprints.org/414/","McCarthy, John","UNSPECIFIED","       <span class=\"person_name\">McCarthy, John</span>     (1964)  <a href=\"http://cogprints.org/414/\"><em>A Tough Nut for Proof Procedures.</em></a>       [Preprint]           ","","1964-07"