Author: Vasik Rajlich
Date: 01:23:54 01/05/06
Go up one level in this thread
On January 05, 2006 at 04:15:54, Uri Blass wrote: >On January 04, 2006 at 22:07:19, Charles Roberson wrote: > >>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. > >A challange for you > >Try to change the evaluation of fruit or another free program to cause it not to >play better when you give it more time. > >Usually even bugs in the evaluation cannot cause speed improvement to be counter >productive. > >In theory I cannot say that it is impossible but if you think that the problem >is your evaluation then try to give it to one of the free programs to >demonstrate your claim. > >If speed improvement does not cause the program to be weaker and you did another >change that caused it to play weaker then the change that you did is clearly not >an improvement in the search. > >The same change may be improvement of the search in another program and the >question what changes are improvement in the search can be dependent on the >evaluation. > >Uri An insanely high king safety may be productive in really fast games. (Just a guess.) Vas
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.