Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Kasparov's and the computers

Author: KarinsDad

Date: 14:39:20 02/02/99

Go up one level in this thread


On February 02, 1999 at 16:31:56, al blanco wrote:

>I kind of disagree with your statement: Stategy is based on intuition,
>pattern recognition (not the ability to anticipate several moves with absolute
>precision) If you agree with this definition it is crystal clear that the
>game of chess will be reduced to a mathematical equation sooner than you
>think.

Actually, I was pulling your leg a little (hence, the caveat in my statement).

As for chess being reduced to a mathematical equation, I doubt it will ever
happen. For that to happen, we could write a program with no search engine, just
a perfect evaluation function. The postulate for this is:

Postulate #1

If you have program x with search engine x, than a drastically faster program y
with search engine y (presumably on faster hardware) could always be eventually
devised which does an exhaustive search 2 (4, 6, whatever) ply deeper than
engine x. This means that program x should lose most if not all games against
program y due to engine x falling into losing positions beyond it's event
horizon.

Hence, if program x could lose a game to program y (due to searching and not
opening book, etc.), then program x does not have a perfect mathematical
equation, hence, a search engine is required if no perfect mathematical equation
exists in the program.

Postulate #2

Since nobody currently has written a chess program with no search engine
whatsoever (to my knowledge) that can actually play a decent game of chess, then
it is many years (if ever) that chess will be reduced to a mathematical
equation.

KarinsDad :)

PS. Talk to Dann Corbit on this. He has an idea about fractals, but I doubt even
that will work.



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.