Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Theory: Deeper Search creating worse performance due to PE

Author: Charles Roberson

Date: 19:07:19 01/04/06

Go up one level in this thread


On January 04, 2006 at 21:49:48, Vincent Diepeveen wrote:

>On January 04, 2006 at 17:41:54, Charles Roberson wrote:
>
>
>Yes it is common for beginner engines that when they implement nullmove for
>first time, they play worse.
>
>All bugs in hashtable and qsearch and elsewhere backtrack sooner to the root
>then.
>
>However assuming a bugfree program and an improvement in search, that will
>always result in better play of course.
>
>Vincent
>

   Agreed!! And under bugs elsewhere, I assume you also inlcude PE's that are
sufficiently out of tune.

    PS: I hear the weather in Europe is rough now. Visiting there in July of
2002 sounds like a better choice than winter.




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.