Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: is Chess a Hard NP? - No!

Author: Robert Hyatt

Date: 07:25:22 01/20/05

Go up one level in this thread


On January 20, 2005 at 07:41:30, Volker Annuss wrote:

>The number of possible positions as well as the number of possible games is
>limited.


Let's do _not_ go there.  Chess is finite, for sure.  But its space is so large,
that today we can treat it as infinite, because no hardware can search the tree
in any time-frame that is meaningful.  It is an exponential problem, which is
beyond the discussion of P/NP type problems, even though it is a finite game.
There is theory and there is reality.  Reality is it is effectively infinite
today.  And for some time yet to come.

And theoretically it is an infinite game as well, since the 50 move rule is not
a _forced_ draw, either (or both) sides can continue playing right through the
50 move rule if they so choose, which further makes this a very hard exponential
problem.



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.