Author: Robert Hyatt
Date: 06:54:28 10/14/99
Go up one level in this thread
On October 14, 1999 at 03:35:07, Shep wrote: >On October 13, 1999 at 22:14:09, Robert Hyatt wrote: > > >>Since you bring this up, I was asked to run this by several people. I did >>on the quad xeon, and got the following results: >> >> 1 2 3 4 5 6 7 8 9 10 >> +-----------------------------------------+ >> 0 | 0 0 10 18 -- 3 35 -- 4 -- | >>10 | -- 20 413 -- 5 0 1 5 1 5 | >>20 | 40 4 20 27 -- -- 0 0 7 18 | >>30 | 331 4 9 -- -- | >> +-----------------------------------------+ >> >>total time = 6380 >>rating = 2605 >> >> >>The square chart above ought to be obvious, positions 1-10 in first >>row, etc. -- means solution not found in 600 seconds. The 'rating' is >>computed by this same log eater, but I am not sure it is correct as I don't >>have the original document explaining this. Would you run the calculation >>to see if this is correct, computationally? If not, please explain the right >>way to calculate the 'rating' and I'll fix the program that produces the above. > >I manually recalculated and got 690 points which means rating=2590. >The LCT2 points are awarded as follows: >0:00-0:09 30 points >0:10-0:29 25 points >0:30-1:29 20 points >1:30-2:59 15 points >3:00-6:29 10 points >6:30-9:59 5 points >>10:00 0 points > >--- >Shep I'll check my math then. It is close enough to yours that it suggests some 'rounding' noise somewhere due to integer values where integers truncate.
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.