@11111
"Why not the cube root"
For strongly solving: N white moves * N black replies = N² positions
For weakly solving: N white moves * 1 black reply = N positions = Sqrt (N²) positions
My comment about cube root was a joke.
But the square root idea looks like its a joke too.
I would not call it a joke...it's a "common" enough methodology, used in checkers, finding prime numbers, etc. The problem is that Tygxc has not even begun to show that it would be applicable to chess, and that if it is, it likely applies to all possible games, the Shannon number 10^120, not unique positions.
The Shannon number is not and never was intended to represent the number of all possible games. Not even under competition rules (it's obviously infinite under basic rules).
@11111
"Why not the cube root"
For strongly solving: N white moves * N black replies = N² positions
For weakly solving: N white moves * 1 black reply = N positions = Sqrt (N²) positions
My comment about cube root was a joke.
But the square root idea looks like its a joke too.
I would not call it a joke...it's a "common" enough methodology, used in checkers, finding prime numbers, etc. The problem is that Tygxc has not even begun to show that it would be applicable to chess, and that if it is, it likely applies to all possible games, the Shannon number 10^120, not unique positions.