dear Peter, > The page at > > http://en.wikipedia.org/wiki/Go_and_mathematics > > gives an astonishing lower bound of 10^(10^48) for the number of Go games. > I'm looking for the corresponding number for Chess, but I'd be shocked if it > was lower than 10^48 (as the original statement asserts).
I made that statement about the number of digits exceeding the number of chess games in an interview with Peter Shotwell, but I was wrong. I went a little overboard in trying to show that the gap in number of games between go and chess is so much larger than the gap in number of positions. With both Go and chess, the number of games is exponential in the length of the longest possible game. But whereas in Go, this length is itself exponentially large (over 10^48), in chess it is only around 6000, due to the 50-move rule. So there is an exponential gap in the number of games. It would have been correct _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
