Re: [computer-go] Pattern Matcher

["Frank de Groot" <frank@xxxxxxxxxxxxx>]

> 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.


Sorry, I don't understand.
I also don't store any superfluous low order bits and the distribution has
nothing to do with the size of the blocks/slots.
Yes, I do have blocks as a power of 2, but that is to exactly fill one or
two cache lines.

..AFAIK

Neither do I understand why modulo can't be done with ANDs in case of
non-power of 2..

It seems Vincent & I are both n00bies when it comes to programming :)

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