Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: search extension

Author: Ernst A. Heinz

Date: 03:26:41 07/08/98

Go up one level in this thread


On July 08, 1998 at 06:20:18, Inmann Werner wrote:

>To make ma program faster I included Null-Move and a cutoff one ply
>before the horizon, if the position is "good".
>On the other hand, simple mates go beyond the horizon (also because of
>small quiet search).
>
>My idea:
>
>If I do a Null-Move it Cuts if greater Beta. OK
>if it is much lower than alpha I extend the search, because it could get
>to some interesting mate.
>
>The idea behind: In Null move the other side can do 2 moves in row. If this
>gets to a very high score (mate) it is interesting enough to extend.
>I made some tests, and the program really found the mates 1 to 2 plys faster.
>Also, the program does not get much slower.
>
>Is this a "good idea". Why not use Null-Move the other way round?
>
>Comments?
>
>Werner

Sounds like you reinvented the so-called "deep search extensions".

For more information, please search for the key words "deep search"
in the titles of older CCC posts of mine.

=Ernst=



This page took 0.04 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.