On 14.12.2011 20:41, Don Dailey wrote:
I think both games are finite due to repetition or ko, right?
It does depend on the restriction rules (ko rules, suicide rules and game ending means like successions of passes). It is straightforward to construct for chess what exists for go rules (Japanese style ko rules: infinite. Superko: finite). One can design either game to be finite or infinite.
For infinite ko rules, all games "ending in" the same cycle can be put into the same equivalent class. Thereby one gets a finite number of different classes of games (i.e. symbolic move-sequences). Before you invent another annotation, this is the go rules theory convention: [abc..][kk..k]*, where * denotes a cyclic part and k a ko play. Regular go ends look like [abc..pp], p is pass.
-- robert jasiek _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
