Author: Charles L. Williams
Date: 09:55:48 05/04/99
Go up one level in this thread
On May 04, 1999 at 11:26:29, KarinsDad wrote: >I was wondering how deeply most programs extended the search at a given ply for >check. > >I implemented singular extensions, check extensions, and capture extensions into >my code last night, but ran into the problem of check extensions potentially >expanding the extensions into near infinity. > >How many checks do most programs consider is enough when extending? > >Thanks, > >KarinsDad :) > Do you check for repeating positions? A capture can't repeat, but checks can. Maybe the same checks are happening more than once. >PS. Will, we realized that our nps is way off. We were compiling the code in >debug mode as opposed to optimized mode. So, our 100 knps went up to 209 knps. >Duh! You must have a fast machine. I'm getting around 14knps in release, but then I've got a 133Mhz Pentium. Looks like I need to take a trip down to my local computer dealer, and quite possibly optimize my move generation. :) Chuck
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.