| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Transactions: good or bad?
Bob Badour wrote:
> Where is your proof that all chess games halt?
For this I have a comment. For the rest of this argument, I'm staying the hell away.
The rules of chess allow the side to move to CLAIM a draw if either of the following occur:
With these rules taken literally, a chess game can be infinite. Each side can play the same two moves repeatedly, and if neither claims a draw, the game doesn't halt. E.g.:
etc..
If the rules were changed to remove the option -- i.e., change the "may claim" to "shall claim," then a chess game becomes finite, and always halts.
Larry Coon
University of California
larry_at_assist.org
and lmcoon_at_home.com
Received on Fri Jun 20 2003 - 23:54:49 CDT
![]() |
![]() |