Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Problem searching too deep!

Author: Sune Fischer

Date: 03:14:38 05/27/02

Go up one level in this thread


On May 27, 2002 at 05:52:21, José Carlos wrote:

>  If I understood you right, you can simple put this on top of AlphaBeta() and
>QSearch():
>
>  if (ply >= MAX_PLY) return Eval();
>
>  With 'ply' being the current depth, that you increment on every MakeMove() and
>decrement on UnMakeMove().
>
>  José C.

Yes, I guess that would work, technically.
But having a check like that in the alpha-beta and the qsearch is all too often
just a waste of time.
I would like to solve the problem at the root if possible.

Also I don't know what happens to the scores if you just start returning the
evaluation with no regards to horizon effects.
I'd expect the result returned from a 45 ply search without these cuts to be
more exact than a 46 ply search that does the cutting.

-S.



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