Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: What are the ELO'S of the programmers that post here?

Author: Peter McKenzie

Date: 23:27:14 03/12/02

Go up one level in this thread


On March 13, 2002 at 01:14:45, Uri Blass wrote:

>On March 12, 2002 at 19:05:17, Scott Gasch wrote:
>
>>>And if you understand majorities, and weak squares, and endgame concepts like
>>>split passers and weak pawns, then you are not going to be a _weak_ chess >player yourself, except for the lack of tactical skills commonly caused by >not playing enough OTB.
>>
>>I agree.  I think too often people discount several authors as "weak".  What
>>they fail to understand is that you can be a "weak" author and still read chess
>>literature / get chess ideas from stronger players.  Personally I've read
>>several books in order to improve my engine's evaluation function and opening
>>book.
>
>What about improving the engine's search rules.
>everybody here think that being a better chess player may be important for
>better evaluation when I think  that the main advantage of good players is
>better search rules.
>
>The chess books usually do not teach people which lines to search and I do not
>know about a book that tries to teach tactics by questions that are not about
>solving tactics but about which node to search next.
>
>A gm may try to write the tree that he thinks about in many positions and try to
>find from the tree rules which lines to extend and which lines to prune.

I think is totally unrealistic.  Computer search is so far removed from human
search that I can only see this as being all but useless.

Strong players have a hard enough time explaining their thoughts about
evaluation, the situation is much worse when it comes to search.  Strong players
don't really know how they think, despite the writings of GM Kotov.

Understanding search is one if the unique things about computer chess, its very
different to both chess knowledge and programming knowledge.  Understanding the
full ramifications of the various flavours of extensions, pruning, move
ordering, windowing etc is one of the greatest challenges of computer chess.

>
>Uri



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.