Author: Uri Blass
Date: 03:31:23 05/20/03
Go up one level in this thread
On May 19, 2003 at 23:46:58, Will Singleton wrote: >I was trying to figure out why my latest build doesn't do quite as well on >ecm86, and I ran Ruffian on it. To my surprise, Ruffian couldn't solve it, even >given 5 minutes. This is odd, since most other progs can do it in less than 10 >seconds. (What I take away from this exercise is that my program must now be >stronger. Otherwise, I'd have to work on the problem, which is much less >interesting than testing new ideas.) > >[D]2r3k1/1nqbrp2/p5pp/1p1Pp1N1/8/1P5P/P1B2PP1/2RQR1K1 w - - I do not think that the fact that your program failed in the same position that Ruffian failed is a proof that it is stronger. I do not say that it is not stronger but only that you cannot use it as a proof. Uri
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.