Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Genius' asymmetric search in example: TRY out !

Author: Don Dailey

Date: 12:24:11 01/02/98

Go up one level in this thread


>The point is to find out if in the normal playing style Genius does
>asymetry in the first plies or not. I suppose Thorsten can find
>positions where this is obvious. Give him some time to publish such
>positions.

It's my understanding that Genius has a full width base.  I do not
believe there is any asymetry going on here at all.  It may appear
that way because if you lose several ply of search on a problem
because of asymetry it will not be obvious why.   But it's my
opinion that any problem is guaranteed to be solved eventually
by Genius.

It's my belief also that it's wise to construct your program such
that it is guaranteed to improve with time and depth, and that
there should be no problem it could not eventually solve (although it
could take billions of years with current hardware.)   A program that
prunes at all levels will not have this behaviour is guaranteed to
fall behind with age and better hardware.

With recursive null move a program "in principle" increases its "full
width" depth on each iteration.  This is good, and part of the success
of null move pruning.   I say "in principle" though because this is not
entirely true.



-- Don





This page took 0.01 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.