Computer Chess Club Archives


Search

Terms

Messages

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

Author: Vincent Diepeveen

Date: 15:20:19 04/28/04

Go up one level in this thread


On April 28, 2004 at 18:03:05, Sune Fischer wrote:

>
>>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.

Yes many, i remember Stefan and Rudolf and many others already saying for years
i should do something on diep's search.

Yet i feel only now i bugfixed my evaluation a lot, that it might be worth to
spend a few days at. Perhaps i'll do it next week.





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