News for hackers. Stuff that matters.

A comment on Is a Proof a Proof If No One Can Check It? .

Re:Is a Proof a Proof If No One Can Check It? by sireat on Thursday June 25, 2009 @08:26AM (#673530)
In some ways this kind of proof is similar to computer generating massive end-game databases for chess.

The resulting perfect play for some endgames is incomprehensible to a human GM and can last for more than 100 moves.

http://www.xs4all.nl/~timkr/chess/perfect.htm

[ Parent | on HN ]

There are no comments on this comment yet.