Computer Chess Club Archives

Search

Messages

Subject: Re: Problem searching too deep!

Author: Georg v. Zimmermann

Date: 05:51:04 05/27/02

Go up one level in this thread

>It seems better both with respect to speed and accuracy to deal with this
>problem at the root, if possible.

I think its impossible. Your safety-margin idea doesnt really work because the
point of a qsearch termination is indeterminable (nice pun huh).


>After all, scores probably don't change much from a 45 ply search to a 60 ply
>search (theoreticly), but the strange scores you get around ply 60 by cutting
>may change the scores all the way up the tree, I don't know.
>
>Perhaps the best would be to completely remove the depth limit and just let it
>go as deep as it can in the given timeframe?

That doesnt work either. Or all your arrays that hold takeBack Information for
example get far oversized.

Georg

• Re: Problem searching too deep! Sune Fischer 06:15:40 05/27/02
  • Re: Problem searching too deep! Sune Fischer 06:25:04 05/27/02
    • Re: Problem searching too deep! Georg v. Zimmermann 02:22:12 05/28/02
      • Re: Problem searching too deep! Sune Fischer 03:19:22 05/28/02
        • Re: Problem searching too deep! José Carlos 05:42:52 05/28/02
          • Re: Problem searching too deep! Sune Fischer 06:03:45 05/28/02
            • Re: Problem searching too deep! José Carlos 06:22:46 05/28/02
              • Re: Problem searching too deep! Sune Fischer 06:46:25 05/28/02

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.