Author: Ulrich Tuerke
Date: 07:46:05 11/17/97
Go up one level in this thread
Hi ! Okay, now I see the idea. In fact, if Bob got it right, then the idea is some kind of "fail high reduction" as suggested by Feldmann. However, Feldmann's suggestion is not that radical: he just reduces the number of plies to the horizon by 1, if score >= beta- thus still including the quiescence search. One would also have to account for a large number of exclusions to make this reasonably work (do not cut when in check, when the side to move has hanging pieces, and so on). In any case, this idea is worthwhile to experiment with it. In my program I implemented some similar algorithm at depth=1. This a forward pruning mechanism which is completely independent of null move heuristics. By the way, Feldmann's article was published in some conference proceedings in 1996 as far as I remember. Regards, Uli
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.