Author: KarinsDad
Date: 08:26:29 05/04/99
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 :) 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!
This page took 0.01 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.