Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The Scalable Search Test

Author: Gian-Carlo Pascutto

Date: 11:06:42 06/19/00

Go up one level in this thread


On June 19, 2000 at 13:30:47, blass uri wrote:

>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.

What you mean is to use some kind of special matesearch, and if that doesn't
gain you anything, use the standard search instead.

I doubt that you'd gain much by this for standard chess, but then again, at
sufficiently large timecontrols it wouldn't hurt much either.

Actually most loser's chess programs already use this technique. There exists
a special kind of search called proof number search that is extremely fast in
proving mates.

--
GCP



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.