Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: What do programmers think about a chess algorithm??

Author: José de Jesús García Ruvalcaba

Date: 03:46:14 12/11/02

Go up one level in this thread


Hi Dann,
it is not necesary to store or search any big tree to solve chess. There is
actually a polynomial P, whose variables are the number of each piecetype on
each square (it can be only zero or one) and the castling and e.p. rights (I am
assuming the position has not been repeated, for practical purposes it is ok to
do that), which orders the chess positions with their theoretical value (i.e. P
takes higher values for white wins than for draws, and lower values for black
wins than for draws).
Of course nobody has found any such polynomial, and I do not expect it to be
found during my lifetime, but they exist and they provide a solution to the game
of chess doing only searches of depth one.
José.




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.