Author: blass uri
Date: 22:07:47 02/09/00
Go up one level in this thread
On February 09, 2000 at 22:52:05, Thorsten Czub wrote: > >i do wonder why you play it out when you believe that >slow programs are weaker, because they are slower. > >i mean: when you believe this, why testing ? Enrique does not believe that slow searchers are weaker. Hiarcs7 won his previous tournament and it is slower in NPs relative to other programs in his tournament. Enrique found from his experience in the past that good solvers of his secret tactical test suite are better in the ssdf list but found that this theory is wrong for junior that got better results in games inspite of not being a good solver. > >just sort the programs in the order of NPS >and you get the right order who wins your tournament. Or ? >do i miss something ? Yes You miss the fact that it is not the right order. It is also possible to change the definition of NPS without changing the programs. 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.