Author: Steve Maughan
Date: 13:18:54 07/08/02
Go up one level in this thread
Dann, > /* This is my own formula, offering scaleable search depth reduction > * between one and 2.5 ply depending on the depth to which you are > * searching */ > return ONEPLY + (depth > (ONEPLY * ONEPLY) ? (ONEPLY) : (depth / ONEPLY)) + >((depth > ONEPLY) ? (HALFPLY) : (0)); >} Any chance of putting this as a plain formula for us Object Pascal people - it's a little to cryptic for me to 'C' >Vincent's double null move idea also seems to be a clear win. In what sense? To avoid zugwag? Thanks, Steve
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.