Most programmers conveniently ignore the issue. And they might as well. Even if they store 2^24 positions in a hashtable, and do a search of 2^24 positions, the collision probability is at most 2^(24+24-64) = 1/65536, which can be considered negligable.
Your statement is only true when the hashes are generated with best statistical distribution. Which they never are, not even close. We're talking several-orders-of magnitude-not-even-close with traditional methods. Hint: Most random generators *totally suck*. Any programmer who conveniently ignores this issue is in for a nasty surprise. _______________________________________________ computer-go mailing list computer-go@xxxxxxxxxxxxxxxxx http://www.computer-go.org/mailman/listinfo/computer-go/