Computer Chess Club Archives


Search

Terms

Messages

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

Author: Uri Blass

Date: 00:45:50 06/04/02

Go up one level in this thread


On June 04, 2002 at 02:11:40, Russell Reagan wrote:

>I've always heard, better algorithms will beat the fastest code using a less
>efficient algorithm any day (IE MinMax vs. Alpha-Beta). My question is, when do
>you stop working on algorithmic type stuff and start working solely on adding
>knowledge to your program, and focus solely on the evaluation function? Or is
>there a even point at which you stop working on things like search and only
>focus on evaluation?
>
>To me, it seems like there is only so much you can do in terms of improving the
>searching methods, improving the efficiency of various other functions that are
>used often (is square attacked, make move, generate legal moves, etc.). Do you
>ever reach a point where the only thing left to significantly improve is the
>evaluation function?

I think that for the near future both things are going to be
important.

I think that the main important thing in chess is tactics but
it does not mean that evaluation is not important.

Better evaluation can help to be better in tactics.

The point is that search decisions which lines to prune
are based on evaluation(for example null move pruning).

If the program has better evaluation function it can
get better decisions in it's search.

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.