Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Strategy vs Tactics in Computer Programs

Author: Uri Blass

Date: 06:22:20 04/20/02

Go up one level in this thread


On April 20, 2002 at 08:36:39, Mike Hood wrote:

>After the Smirin vs Shredder match voices became loud saying "Today's computer
>programs may be brilliant at chess tactics, but they are still weak at chess
>strategy". I agree with this statement, except for the word "still". My
>contention is that it is not possible to give computer programs any strategical
>understanding whatsoever.
 Everything is based on positional evaluation and
>search depth. If the search depth is deep enough, a computer may make a series
>of moves that simulate a strategy, but that's all it is: a simulation; a fake.
>
>Strategy is all about looking at the board and planning a series of moves to
>achieve a goal, whether it's a positional improvement or material gain. Computer
>programs don't do this. All they do is look at the current position and choose
>the next move. That's all.

I do not know what computer programs do because I do not know the source code of
Hiarcs,Junior,Shredder,Tiger.

Assume for the discussion that they only use static evaluation function and
search.

How do you know that it is impossible to teach them more than it?
I believe that it is possible to do it if programmers write the right program.

I do not think that it is easy but I do not believe that there is something that
humans know that computer cannot learn if the right programmer writes the
program.

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.