Author: Dann Corbit
Date: 21:28:46 07/28/03
Go up one level in this thread
On July 29, 2003 at 00:16:53, macaroni wrote: >I have been having great trouble finding an efficient routine for Repetition >checks, I can get the zobrist keys of the current line being searched, but what >is the best (if there is a best) method of comparing them to check for 3 the >same? it seems crazy to loop through all of them for each one, looking for like >positions. Is there something really simple and nice i'm completely missing? or >is that the only way, >Thanks all :) The list should stay short, since you throw it out after any capture or pawn push and start over. If the position is not in the hash table anywhere (ignoring depth), no need to search -- you have not seen it yet. If you are really concerned, you could store the list in a heap or skiplist. You could even have a hashtable of the hashes. I think that mostly nobody bothers with that and simply perform linear searches.
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.