Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: When to do a null move search - an experiment

Author: Sune Fischer

Date: 15:03:05 04/28/04

Go up one level in this thread



>That's what people do not realize here at CCC. In those tournaments i learn more
>than at internet *ever*, simply because no commercial is objectively posting
>here but just seeing it here as a chatbox.
>
>Yet the above code is already working a lot better than verification.
>Verification will always add a last ply which doesn't ever happen here.
>
>So the overhead of verification search is *huge*, especially if you consider how
>big my qsearch is.
>
>80%+ of all diep's node in openings search are already qsearch nodes.

So, has anyone at those tournaments where you learn so much ever asked you, why
you choose to spend so much time on the most crappy form of selective search
(qsearch)?

-S.



This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.