Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: blitz versus long control rankings: knowledge versus search depth

Author: Maurizio Monge

Date: 14:07:20 12/28/05

Go up one level in this thread


>
>So bringing it back to chess engines.....What distinguishes the playing quality
>of one engine from another? Can we apply what we have found with humans (e.g.,
>it is differences in quality of knowledge)?
>Or is computer chess so different as to make any comparison irrelevant?
>
>best
>joseph

I have always been thinking that, increasing the time control, the best programs
are going to be those which use better algorithms in the search function, ie
achieve a smaller branching factor (with the same correctness).
On the other side, for lightings it becomes more important the code
optimization, because it allows the program to search deeper.
I expect that a highly optimized program written in assembler that uses a simple
search function will dominate in lighting, but in very long time controls it may
lose agaist a slow program written in java (but with a more elaborated search
function that "cuts" the search tree more intelligently).
BTW, I don't know how chess knowledge relates to time control wrt the engine
speed, ie is putting a lot of chess knowledge in the evaluation (and slowing the
program) going to change the strenght relatively to the time control?
Maybe some chess programmer more expert than me will answer :)

Ciao
Maurizio



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.