Author: Ingo Bauer
Date: 06:24:14 12/13/03
Go up one level in this thread
On December 13, 2003 at 09:19:42, Albert Bertilsson wrote: >On December 13, 2003 at 04:45:02, Ingo Bauer wrote: > >>Hi >> >>>Ordering by MNPS would be easier and actually favour those lucky enough to get >>>the large problems (large problems are searched faster because of the hash table >>>(specially for those with 512MB+ ht)). >> >>But then YOU have the problem that some will switch off their slower computers >>to maintain a high MNPS rate! Overall that would be slower for the project. >> >>Ingo > >True, it would be really bad if several computers were turned off just to get >high stats. I have to think about this... > >/Regards Albert Absolut node count, problems/solved. Thats it. For the perft 12 problem I would suggest to have something to show No. of comps or threads (duals) too. But the seperation has to be done automaticly by the client. Ingo
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.