Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Search Speed vs. Chess Knowledge

Author: Will Singleton

Date: 16:06:05 05/24/99

Go up one level in this thread


On May 24, 1999 at 18:12:26, Chuck wrote:

>In light of the Rebel 10 - GM Rhode game, it would seem that a new
>emphasis has been placed on positional understanding as opposed to
>tactical efficiency in chess programs.
>
>I wonder what the opinon is of the CCC programmers on this. To create
>a grandmaster-level program, do you need to sacrifice more speed for
>knowledge than has been done in the past? Can a pure tactical searcher
>like Fritz make it over the hump to grandmaster-level?
>
>Chuck


I think it's extremely difficult for a computer to do GM-type positional
assessment.  The human brain seems better setup to do that type of
pattern-matching, selective recall, etc.  At Deep-Blue type depths however,
short-term positional understanding becomes less important, since small (or
large) tactical maneuvers can be found, resulting in either material gain or a
simple positional betterment.

At a certain depth, the GM can't compete.  We haven't reached that yet, but
theortically it's true.  So, yes, I'd say that due to the inherent difficulties
of the linear computer-model, the only way to beat a GM in the future is to go
deeper, bean-counting style.

Will



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.