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 incompr

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 http://www.xs4all.nl/~timkr/chess/perfect.htm