Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: takes shredder5 51 seconds to find mate in one

Author: Uri Blass

Date: 05:06:29 09/28/01

Go up one level in this thread


On September 28, 2001 at 06:48:02, Gian-Carlo Pascutto wrote:

>On September 27, 2001 at 18:13:57, Roy Eassa wrote:
>
>>Would it be reasonable, then, for modern programs to avoid doing extensions on
>>the first several ply?  Or for the first 1% of the allotted time?  Or something
>>like this?
>
>As Christophe already explained, this isn't a matter of extensions (those
>_are_ nearly always limited to prevent explosions like this) but of
>a quiescent search going mad.

This is a question of definition
you can look at quiescent search as extensions.

I understand that it is probably not the usual definition for programmers but
I believe that it is the way that most non programmers understand the word
extensions.

I also believe that leonid understands the word extensions in this way and I
know that when Genius says selective search 0 it means also not using qsearch.

Uri



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.