Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: What is the q-search?

Author: Bruce Moreland

Date: 22:53:23 01/08/00

Go up one level in this thread


On January 08, 2000 at 12:41:13, Antonio Dieguez wrote:

>On January 08, 2000 at 11:56:25, Dan Andersson wrote:
>
>>>"Extensions" are usually used to keep a program from running out of search
>>>depth. My understanding was (probably very wrong) that extension are some kind
>>>of addition search done for few next plys deep. If this is really so, how can
>>>extension "keep program from running out of search depth"?
>
>that phrase traduced to spanish is not very clear I suppose you have the same
>little problem, may be keep program from running out means keep program running
>in ?
>
>>You said it yourself! By adding more depth.
>>
>>Regards DAn

You start out with some number of plies of depth, like for instance 8, and every
time you make a move you decrement.  So if you have 8 now, you make a move and
now you have 7.  Then you make a move and have 6, etc.  Eventually you have 0,
and you cut to qsearch.

Let's say you have 8 now, and an extension kicks in.  You still have 8.  Another
one kicks in, and you still have 8.  So you avoid running out of remaining
depth.

Other ways to do it but that's good enough.

bruce




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.