Computer Chess Club Archives


Search

Terms

Messages

Subject: chess problems by computer

Author: Richard Bean

Date: 16:13:37 01/20/04


http://www.cs.berkeley.edu/~flab/chess/chess.html

Check this out - he's the second person to verify my perft(10) calculation after
Albert Bertilsson.  But not only that, he verified my calculation of the number
of unique positions up to 8 ply, and extended my calculation of the number of
mates at each ply from 8 to 10 ply!!

http://www.research.att.com/projects/OEIS?Anum=A079485
http://www.research.att.com/projects/OEIS?Anum=A089956
http://www.research.att.com/projects/OEIS?Anum=A089957

With results like this, finding the shortest stalemate must be within reach!



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.