Computer Chess Club Archives

Search

Messages

Subject: Re: How do other programs handle check extensions?

Author: Andrew Williams

Date: 09:40:05 05/04/99

Go up one level in this thread

On May 04, 1999 at 11:26:29, KarinsDad wrote:

>I was wondering how deeply most programs extended the search at a given ply for
>check.
>
>I implemented singular extensions, check extensions, and capture extensions into
>my code last night, but ran into the problem of check extensions potentially
>expanding the extensions into near infinity.
>
>How many checks do most programs consider is enough when extending?
>
>Thanks,
>
>KarinsDad :)

My program simply says "if the iterative deepener started this search
with depth=D, don't extend beyond 2*D". This is a naive approach, and
I'd also be interested in hearing what anyone else does.

>
>PS. Will, we realized that our nps is way off. We were compiling the code in
>debug mode as opposed to optimized mode. So, our 100 knps went up to 209 knps.
>Duh!

209knps!! What position?

Andrew

• Re: How do other programs handle check extensions? KarinsDad 10:07:42 05/04/99
  • Re: How do other programs handle check extensions? Will Singleton 12:03:08 05/04/99
    • Re: How do other programs handle check extensions? James Robertson 12:28:19 05/04/99
      • Re: How do other programs handle check extensions? Will Singleton 15:32:29 05/04/99
        • Re: How do other programs handle check extensions? James Robertson 17:41:48 05/04/99
          • Re: How do other programs handle check extensions? Will Singleton 19:05:04 05/04/99
            • Re: How do other programs handle check extensions? James Robertson 20:02:18 05/04/99
      • Re: How do other programs handle check extensions? KarinsDad 13:02:15 05/04/99

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.