Computer Chess Club Archives

Search

Messages

Subject: Re: Qsearch Checks

Author: Bas Hamstra

Date: 11:30:01 09/05/04

Go up one level in this thread

>My program has this in relation to checks, all conditionally compilable:
>
>  1) all checks-evasions in quiescence, unlimited occurrences
>  2) all checks-evasions in main search, unlimited occurrences
>  3) all checking-moves in quiescence, at the first ply of quiescence
>
>These are the three extensions. Only #1 and #2 have proved useful.

Impossible. When I did 3) it solved wac141 within one second, using a mate
extension of a full ply. It takes 30.000 nodes and 6 plies to anounce M6.
Without it it has a hard time and it takes very long. The point is: if your
qsearch cannot find a simple mate in one (a capture only qsearch wont) chances
are you will find this mate a full 3 plies later than necessary.

If you implemented 3) your program should mate-extend like crazy here...

Bas.

• Re: Qsearch Checks Uri Blass 11:56:14 09/05/04
  • Re: Qsearch Checks Bas Hamstra 12:58:39 09/05/04
    • Re: Qsearch Checks Uri Blass 13:44:32 09/05/04
    • Re: Qsearch Checks Stuart Cracraft 13:37:32 09/05/04
      • Re: Qsearch Checks Uri Blass 14:02:49 09/05/04
        • Re: Qsearch Checks Bas Hamstra 15:30:30 09/05/04
          • Re: Qsearch Checks Stuart Cracraft 16:14:30 09/05/04
            • Re: Qsearch Checks Uri Blass 16:34:21 09/05/04
              • Re: Qsearch Checks Stuart Cracraft 19:14:26 09/05/04

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.