hi Frank,
It uses 2 modulo operations per lookup.
Why don't you use an AND? Vincent already mentioned that. A simple AND is the same as a modulo, n'est-ce pas?
My hashtable size N is a prime, not a 2-power. That way I get a nice random-like distribution of positions over the hashtable. How do you get as good a distibution with a 2-power sized hashtable?? Plus, I don't have to store the low-order log_2(N) bits of the key in the hashtable. regards, -John _______________________________________________ computer-go mailing list computer-go@xxxxxxxxxxxxxxxxx http://www.computer-go.org/mailman/listinfo/computer-go/