Accession Number : AD0785037

Title :   A Tough Nut for Proof Procedures,

Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s) : McCarthy,John

Report Date : 17 JUL 1964

Pagination or Media Count : 5

Abstract : 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. It is conjectured that this problem will be very difficult for programmed proof procedures. (Modified author abstract)

Descriptors :   *Computer programming, *Game theory, Mathematical logic, Problem solving

Subject Categories : Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE