Computer Chess Club Archives




Subject: Re: Question about evaluation and branch factor

Author: Tord Romstad

Date: 07:00:06 11/21/03

Go up one level in this thread

On November 21, 2003 at 08:53:13, Daniel Clausen wrote:

>On November 20, 2003 at 14:27:27, Tord Romstad wrote:
>>Yes.  The biggest difficulty of all in chess programming is having enough
>>patience to test everything carefully.  There are so many things to try,
>>and each tiny change requires a big number of test games in order to
>>determine if it really improves the program.
>OTOH I can imagine that certain eval-terms only 'work' together with other
>eval-terms (or search-refinements or whatnot).

Yes, that makes the problem even worse.  It is not even enough to test
different terms and tricks individually, you have to test all different

>Otherwise you may find the maximum in your local town but not in the whole
>country. :) [which is probably ok in your case, since Oslo is by far the
>biggest city in Norway as far as I know ;)]

It is, although that says more about the other cities than about Oslo.
In addition to being the biggest city, Oslo is also one of the few places
in Norway where you can occasionally experience something resembling
nice summer weather (not every year, though).


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.