Author: Uri Blass
Date: 07:29:45 11/10/01
Go up one level in this thread
On November 10, 2001 at 09:49:09, Andrew Smith wrote: <snipped> >[D]r1b1kb1r/1p1n1ppp/p2ppn2/6BB/2qNP3/2N5/PPP2PPP/R2Q1RK1 w KQkq - 0 1 > >This looks to be one of the harder Nolot tests IMO (but far from the hardest I >think). I'm interested what chess programs can solve it, and how fast they have >done it. If you have a chess engine that can solve this one, please post the >analysis. I already posted the analysis of Junior5 some monthes ago and it solved it in less than an hour. Unfortunately I am too lazy to find the analysis or to give Junior5 ro analyze it again. 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.