Where does your 99% figure come from?
Dave Dyer wrote:
Storing an opening book for the first 10 moves requires
33147774514824220000000000 nodes. Even with some reduction for symmetry,
I don't see that much memory becoming available anytime soon, and you still
have to evaluate them somehow.
Actually storing a tree, except for extremely limited special cases, is not
even conceptually possible, and doesn't save much time. Consider that if
you store the tree you saw at the previous move, by the time you get to
use the stored tree 99% of it is useless because your opponent chose his move.
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
