Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The Scalable Search Test

Author: blass uri

Date: 10:30:47 06/19/00

Go up one level in this thread


On June 19, 2000 at 13:22:31, blass uri wrote:
<snipped>
>You can also decide to have a time limit for searching with the extensions(for
>example 1/10 of the time per move).

I mean that you can decide search in the first plies with the extensions and
after 10% of your time to continue to search the rest of the plies by regular
search if you do not discover something interesting.

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.