Computer Chess Club Archives

Search

Messages

Subject: History heuristic and high search depths

Author: Alvaro Jose Povoa Cardoso

Date: 08:02:22 12/08/03

I've been thinking about the efficiency of the history heuristic at high search
depths.
It seems to me that the history table will be overwritten many times if we have
a search of several billions of nodes. Additionally, as the search moves to
different parts of the tree the history table values will be somewhat trashed.
What do you think we could do about this?
Maybe limit the history heuristic to a certain depth (ex: the nominal depth).

Comments anyone?

Regards,
Alvaro Cardoso

• Re: History heuristic and high search depths Tim Foden 13:19:48 12/08/03
  • Re: History heuristic and high search depths Ulrich Tuerke 03:54:24 12/09/03
    • Re: History heuristic and high search depths Gerd Isenberg 13:01:43 12/09/03
  • Re: History heuristic and high search depths Steffen Jakob 13:50:09 12/08/03
    • Re: History heuristic and high search depths Heiner Marxen 08:24:44 12/09/03
      • Re: History heuristic and high search depths Steffen Jakob 08:49:24 12/09/03
    • Re: History heuristic and high search depths Alvaro Jose Povoa Cardoso 14:20:19 12/08/03
      • Re: History heuristic and high search depths Steffen Jakob 14:26:44 12/08/03
• Re: History heuristic and high search depths Robert Hyatt 08:34:07 12/08/03

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.