Author: Ed Schröder
Date: 11:23:54 10/25/04
Go up one level in this thread
On October 25, 2004 at 13:40:33, ThatsIt wrote: >Hi Ed ! > >I understand but the error margin is way too high for a final conclusion. Let me >explain the problem with fast time controls like these. The average move-time is >about 5-6 seconds, the decision to go one ply deeper (or not) around 2-3 >seconds. Now Windows is famous for interrupting your PC every x seconds snooping >following its own unfathomable ways, doing some maintenance etc. This cost >processor time eating tenths of seconds just enough to prevent engine X to go to >the next iteration and so a different game is born because of the randomness of >Windows. > > i understand > one more hint that blitzmatches only produce scrap > > > so i decide to test further on, now with > 8min/40moves+8min/40moves+... > Ruffian 2.10 vs List 5.12 (both UCI) > 160 games (80 noomen-positions) > 1 match and after that 3 repetitions > >Best G.S. Interesting indeed. You also might want to try to repeat my experiment with different engines loaded at program start. Cherio, Ed
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.