Author: John Merlino
Date: 18:23:10 06/17/02
Go up one level in this thread
On June 17, 2002 at 21:15:18, Russell Reagan wrote: >On June 17, 2002 at 21:05:48, John Merlino wrote: > >>X = brute force search depth >>Y = MINIMUM extension depth > >Hmmm...still a little confused :) > >I understand what maximum extension depth would be. That would be the highest >(or deepest) depth reached anywhere in the search. The minimum extension depth >isn't quite as obvious to me. Is this the first depth after qsearch where an >extension of some kind occured? > >How does what you do with X/Y differ from what other engines do? > >Russell To put it another way, Johan calls 'Y' the "nominal search depth". Unfortunately, that's pretty much where my technical knowledge runs out, I'm afraid. I'll ask Johan for a clarification to your questions.... jm
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.