Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Repitition detection

Author: Bruce Moreland

Date: 10:35:27 12/27/02

Go up one level in this thread


On December 27, 2002 at 05:24:54, Russell Reagan wrote:

>Ok. Makes sense so far. So, when you probe, you start with the "normal" index
>that you get from the hash key (key % size, or whatever), and then compare hash
>keys until you find a match, or until you hit an entry where the "index" portion
>of the keys no longer match? Or do you stop probing at a certain number? For
>example, Vincent says he uses 8 probes. Does that mean he starts at the "normal"
>index, and iterates until he either gets a hit, or until he has tried 8 slots?

This is not the transposition hash.  This is a small repetition hash table.  You
go until you find an empty element.

http://www.brucemo.com/compchess/programming/repetition.htm

bruce



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.