Re: [computer-go] Re: Sharing Secrets

[Gian-Carlo Pascutto <gcp@xxxxxxxxx>]

Frank de Groot wrote:

> And, BTW, a 1::65556 chance of collision would be terrible in many cases.
> When searching millions of tree nodes and a hash collision can mean the 
> difference between pruning or not, you'll find such a hasher unacceptable.
This is completely false. It's been demonstrated in the computer chess 
community that a tree searcher can have an enourmous amount of hash 
collisions and still not have a noticeable decline in playing strength.

It's a result of the resilence of tree searching against single-node 
errors. (Which is why the programs are so strong despite the evaluations 
being so wrong so often.)

The issue is different when you're using the hashes outside the tree 
search. (e.g. fuseki library that's probed at the root, a single mistake 
could kill you)

--
GCP
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/