Author: William H Rogers
Date: 16:12:04 02/11/99
Go up one level in this thread
You make a good point there, in fact Larry Kaughman (?) published a set of problems in his Computer Chess Reports a few years ago. He had about 30 problems and a formula for calculating a chess programs stregth, based upon the lenght of time it took to find the solution. He stated that he had tested the results, and they were very close. So it can and does work. Bill
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.