Author: Dieter Buerssner
Date: 13:28:14 09/03/03
Go up one level in this thread
On September 03, 2003 at 13:43:13, Tom Likens wrote: >Getting the hamming distance in pseudo-code for N random numbers: > >1. Generate a random number (index=M) > >2. Compare it to the 0 ... M-1 valid random numbers alread saved > > if (popcnt64(new_rand64 ^ array[0..M-1]) >= MIN_HAM) then OK > >3. If valid, save it into slot M > If not valid (hamming distance is too small) goto 1 > >4. Repeat until you have N random numbers They aren't random anymore, after you filtered them like that. I doubt, that it will help. It is not clear at all to me, that a big hamming distance gives less collisions, when you combine many such numbers with xor (or other operations like add or subtract). See also http://www.chess-archive.com/ccc.php?find_thread=200622, especially Sven Reichards post, where he gave one concrete example. Regards, Dieter
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.