Computer Chess Club Archives


Search

Terms

Messages

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

Author: Dann Corbit

Date: 15:39:09 12/10/02

Go up one level in this thread


There is a possibility to shrink the tree.

If at least 99.999999999999999999% of chess positions are checkmates or
stalemates, you *might* form a faster solution.  Of course, it might still be
possible to "toe the line" out to a very great distance even if that were true.
A simulation should prove helpful in that regard.  (Throw up random, legal board
positions and count the frequency of terminal states).




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.