Author: milix
Date: 07:06:27 12/26/04
Go up one level in this thread
On December 25, 2004 at 09:51:11, Alvaro Jose Povoa Cardoso wrote: >Could someone please elaborate with details on how does this heuristic works? > >Thanks in advance, >Alvaro Cardoso To my understanding, if we are in a non-pv node and we need to search a move that never gived a cutoff (history value zero) it probably won't give a cutoff here either so we search this node with reduced depth. I think this heuristic is very risky because of the nature of the history table itself (how reliable are the values in this table to be used for search reduction?).
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.