On 31.01.2016 17:19, John Tromp wrote:
It will never be known since there's not enough space in the known universe to write it down. We're talking about a number with over 10^100 digits.
How do you know that an implicit expression (of length smaller than 10^80) of the number does not exist? :)
> [interesting stuff deleted]
It is reasonable to expect the perfect komi does not depend on games of more than 361 moves.
I do not think we may make such a premature claim.
Even with some ko fights, the ko recaptures are likely bounded by the number of unplayed points.
From experience as go players, yes. But... I have seen too many surprising sequences and sacrifices to be sure.
Then we estimate the decision complexity to be upper bounded by 200^181 and the game tree complexity by 200^361.
I won't believe such until proven:) -- robert jasiek _______________________________________________ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
