Author: James T. Walker
Date: 07:46:50 01/04/05
Go up one level in this thread
On January 04, 2005 at 03:02:59, Jouni Uski wrote: >On January 04, 2005 at 02:26:56, Uri Blass wrote: > >>On January 04, 2005 at 01:31:21, Jouni Uski wrote: >> >>>I don't mean copy, but strong as Ruffian 1.0.5 and source - this is sensation!! >> >>No sensation for me. >> >>I predicted before Fruit2 that Fruit will be better than shredder8 in 2007. >> >>The good results of Fabian only suggest that the top programs of today are weak >>because the programmers who work about them are relatively not good programmers. >> >>As far as I know no programmer got good results like Fabian in a short time as >>an amateur(Fabian started to write Fruit in 2003) and I guess that Fabian does >>not live from chess programming and has another job. >> >>>BTW is it joke readme file: >>> >>>"Fruit is not fast (in nodes per second) given the little it is >>>calculating." >>> >>>?? Peaks over 2Mnps on my 2 years old PC! >>> >>>Jouni >> >>I do not think that Fruit can search more than 2M nodes per second on 2 years >>old PC. >> >>Fruit on my A3000 can calculate slightly less than 1 Mnp per second in the >>opening position. >> >> >>Uri > >Try this kind of position: > >[D]8/6k1/8/2K5/4N3/4N3/8/8 w - - > >Tablebases are not slowing engine. > >Jouni I guess that if you don't have tablebase support then you need to search 2 million positions / second to see it's a draw. :-)
This page took 0.01 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.