Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: In chess we will reach diminishing returns just like in checkers

Author: Steven Edwards

Date: 00:23:32 10/29/03

Go up one level in this thread


On October 29, 2003 at 03:15:23, Jorge Pichard wrote:

>"Experiments in Chinook show that there comes a point where increased search
>depth provides diminishing returns."
>
>From a mathematical game theory point of view, checkers is a simpler game than
>chess. There are only 5x1020 positions (5 with 20 zeros after it) in checkers,
>whereas chess has at least 1040 positions. Knowing this how long it will take to
>reach diminishing returns in chess?
>
>http://www.chessbase.com/newsdetail.asp?newsid=1270

Concerning "mathematical game theory point of view": I am a mathematician, and
it does not necessarily follow that a larger position space indicates less
simplicity.  I can easily construct a nim like game with far far more states
than the cross product of the state spaces of chess, checkers, go, poker, and
bridge combined that can be played perfectly by a five line program at instant
speed.



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.