Computer Chess Club Archives




Subject: Logic of implementation.

Author: Dan Andersson

Date: 02:35:45 07/30/04

Go up one level in this thread

This is a drop in Bloom filter test for repetition:
 Key on a bit array A[0..2^k]. On a Zobrist key Z[0..m] with n hashes as long as
k*n =< m.
Key[]=hash[0] or hash[1] or ... hash[n]
 Quick test for repetition:
Filter[] and Key[]
 Adding the key:
Filter[] or Key[]
 Unmake mask:
Filter[] xor (Filter[] or Key[])

 Caveat. I have no idea if this will speed up anything. Or what values might be
best if any.

MvH Dan Andersson

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.