Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The Scalable Search Test

Author: blass uri

Date: 03:21:45 06/20/00

Go up one level in this thread


On June 20, 2000 at 06:05:47, blass uri wrote:
<snipped>
>I suggested to forget about the extensions if you do not find something
>interesting and in this case you are only 10% slower.
>
>I suggested not to forget about the extensions when you find something tactical
>(fail high or a fail low).
>
>Uri

I can add that if you do not want to forget about the extensions  a possible
idea(I am not sure if it can be used) is to  guess for every position that you
search with extensions the number of plies that you need to get there without
extension and extend later only if you get deep enough.

Possible problems:
1)mistakes in guessing the number of plies that you need in order to search some
line(for example programs that use null move pruning cannot know the number of
plies because they do not know which lines they will prune by null moves)

2)calculating the number of plies may takes time.

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.