computer-go: Zobrist hash random?

[nr997@xxxxxx]

Hi Friends

Always i read here to take random numbers for the hash function.
That is not the best way. You take well choosen contants.
For example there should not be numbers like a,b,c where a xor b = c in my 
set of constants, for advoiding too early hash collisions. 
That is one of the main advatages of this hash function not to have
collisions too early.
So you have ...
Ask some good chess programmers, they know. 
So it is granted not to have the same hash value for positions which differs

only (a few stones more or less) little.
For a tree search you want to have it.

Always i read such nonsense of random numbers.
...

Have fun 
Wolfgang

-- 
GMX - Die Kommunikationsplattform im Internet.
http://www.gmx.net