> > I ask because I don't think the 50 move rule is part of the proper game of > chess, >
Incidentally, Go has this nice thing that generalizing to NxN (at least N>=2...) makes sense easily. For proving completeness results this is very convenient, in particular when compared to chess. In chess, it's hard to generalize the 50 moves rule. In particular, if 50 increases linearly with N when chess 8x8 increases to NxN, then by APTIME=PSPACE we see that Chess can not be EXP-complete. As it is usually claimed that Chess is EXP-complete we can guess that persons proving this consider other generalizations of the 50 move rule (or not 50-move rule at all). ((( Someone finds a proof of undecidability of Nash equilibria of (japanese rules) phantom-go ? I have no proof but I offer a cake or a beer or an espresso to the first one who proves it true or false :-) ))) Best regards, Olivier
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
