Guy Macon wrote:
Richard wrote:

Exactly. To put it in chess terms, this would be like a computer
program that proves that it can always win or draw at chess with the
white pieces. Every game, it starts with 1. e4, and it never loses,
then help bot comes along and says "But it didn't prove that chess is
solved, because it's not proven for games starting with 1. d4."

You have posted a clear and simple explanation. So of course
help bot won't understand it...


I don't understand it either. Where in the checkers proof does it say
that only ONE SIDE is assured of a draw?



--
Kenneth Sloan
Computer and Information Sciences +1-205-932-2213
University of Alabama at Birmingham FAX +1-205-934-5473
Birmingham, AL 35294-1170 http://www.cis.uab.edu/sloan/