Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Algorithms vs. knowledge - What to do next?

Author: Russell Reagan

Date: 23:33:55 06/03/02

Go up one level in this thread


On June 04, 2002 at 02:26:57, Dann Corbit wrote:

>You can do things in parallel.  When you are bored with search, work on eval.
>When you are bored with eval, work on search.  A lot of time will be spent
>removing bugs.

What exactly is there to work on in terms of search? Does this include things
like move ordering? Other than that, it sounds like somewhat of a black art.
Like you say that the "limit" is the number of nodes in the principle variation,
so theoretically there is a TON of room for improvement, but it also seems like
there isn't any clear way of achieving that. So it sounds like other than move
ordering, it's kind of a research area, unless I'm missing some other things
that are included in the area of "search", when you speak of improving it.

Russell



This page took 0.01 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.