Author: José Carlos
Date: 07:12:49 12/30/01
Go up one level in this thread
On December 30, 2001 at 09:50:57, Gian-Carlo Pascutto wrote: >On December 30, 2001 at 09:44:41, José Carlos wrote: > >> And about aging hash entries, I do something 'original'. I save the total >>material with the hash entry. As long as the material in there is smaller or >>equal than the root position, I think the hashed position is interesting, >>because it is still possible to reach it. When it is bigger, it is immediately >>replaced. > >a) this takes more bits than a simple age entry > >b) the tree explores so many nodes that even nodes with same >material can be very very different > >c) your table will get full in a blocked position > >This does not look like a very good idea at first sight. > >-- >GCP Of course it's not the best idea in the world, but it's not that bad: a) there are tricks to save space b) it only applies to depth-preferred table, so crap nodes (which are quickly discarded) don't stay long because of depth. And there's also always-replace table. c) block positions usually get open by pawn exchanges, so material decreases and crap nodes get replaced. Also, I only wanted to be useful by commenting my idea. All comments are welcome. José C.
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.