Author: Volker Böhm
Date: 13:57:34 08/22/04
Go up one level in this thread
Hi, there is a kind of mate foreward-pruning: // Max is the maximal positive score // Pruning Condition in Search and Quiescense if (Max - CurDepth <= Alpha) return Alpha; // Can´t reach window if (-Max + CurDepth >= Beta) return Beta; // Can´t reach window Perhaps it fixes your problem I have some hash-problems with this code that leads sometimes to a low mate score. Greetings Volker
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.