I think that would be worse. There are lots of sets of 8 numbers that sum the same, far more than there are sets of 8 with the same minimum element.
Arthur ----- Original Message ----- From: Álvaro Begué <[EMAIL PROTECTED]> Date: Thursday, December 20, 2007 4:08 pm Subject: Re: [computer-go] rotate board To: computer-go <computer-go@computer-go.org> > On Dec 20, 2007 10:19 AM, Jason House <[EMAIL PROTECTED]> > wrote: > > > > > > On Dec 20, 2007 10:15 AM, Arthur Cater <[EMAIL PROTECTED]> wrote: > > > > > With 8 hashes per position, the chance of two different boards > > > producing a different set of hashes but > > > the same canonical hash is greater than 1/2^64, because there > will be > > > a bias in the choice of canonical > > > hashes - toward numerically lower numbers, for instance. > > > > > > I think. > > > > > > More importantly, how does it differ from 8/2^64 = 1/2^61? > > > > If you are going to compute all 8 hash keys, you can just add them > up at the > end instead of picking the minimum. Wouldn't that be better? > _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
