On 12-jan-07, at 14:16, Chris Fant wrote:
Plus, some would argue that any Go already is solved (write simple algorithm and wait 1 billion years while it runs).
To 'solve' a game in the strict sense you need to know the best answer to every move. And you need to be able to prove that it's the best move. To do so you need to look at the following number of positions AMP^(AGL/2) where AMP is average number of moves in a position and AGL is the average game length. If I take a conservative AGL of 260 moves, we can compute the AMP from that, being (365+(365- AGL))/2=235 So we get 235^130, which is about 10^300 as a lower bound. The upper bound is something like 195^170 (play until all groups have 2 eyes) which my calculator is unable to compute, but I think it's roughly 10^400. I'm guessing it's questionable whether we'd be able to compute that even with a computer the size of this planet before the sun goes out. Distributing the work over other planets or star-sysems will only help marginally due to the time it takes to send information to Earth by the speed of light. So I'd say it's impossible.
Mark
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
