Author: Matthew Hull
Date: 14:32:08 09/03/02
Go up one level in this thread
On September 03, 2002 at 17:02:13, Robert Hyatt wrote: >On September 03, 2002 at 16:33:29, Matthew Hull wrote: > >>On September 03, 2002 at 16:26:33, Robert Hyatt wrote: >> >>>On September 03, 2002 at 15:50:45, Matthew Hull wrote: >>> >>>>On September 03, 2002 at 15:42:08, Gian-Carlo Pascutto wrote: >>>> >>>>>http://sjeng.sourceforge.net/ftp/hyatt1.png >>>>> >>>>>I will try to upload the full article as soon as I can. >>>>> >>>>>-- >>>>>GCP >>>> >>>>You've got to be kidding. When Vincent posts the numbers, he's got all these >>>>trailing zeros. What's with that? >>>> >>>>It is Vincent that's faking numbers here, not Bob. Bob's numbers are just >>>>rounded off. >>>> >>>>Vincent is the one emitting bogons here. >>> >>> >>>If you didn't see my response elsewhere, this output was produced by a program >>>I wrote to "eat" Cray Blitz log files. I did this for my dissertation as I >>>produced tens of thousands of test position logs for that. >>> >>>I believe that it does something similar to what I do today, which means that >>>anything between 1.71 and 1.8 is treated as 1.8, 1.81 to 1.9 is 1.9. I am >>>not _certain_ as I don't have any of the old files left, they were all lost >>>somewhere around 96-97. And I might be wrong. But something tells me that >>>all this was integer values in Cray Blitz's logs, which means that it would >>>be convenient to compute speedup = something + roundup and truncate it as it >>>was all done in integers. >>> >>>however, I won't bet my life that I did that as the "log eater" was written in >>>1987 while working on my dissertation. that is a _long_ time ago to remember >>>some tiny detail inside the thing... >> >> >>Well, as soon as I saw the REAL output, it was obvious someone was desperate for >>a dispute. >> >>I'm sure many here appreciate your patience in explaining things, even when some >>seem only to take delight in "winding up the professor". I've learned alot of >>useful info in the process. >> >>Thanks! > > >Not much more I can say. I _really_ don't remember the details of the "log >eater". Especially since I had to write a new one for Crafty after the CB >eater was lost. Remembering what I did in the days of 16bit/32bit ints is >probably impossible... > >I couldn't begin to guess whether I did something to the data, and then had to >"undo it" before displaying it. Guessing would be pointless. I might poke >around our old backup archives to see if I can find something, as I have time, >but it won't be fast or easy. particularly when some of the old backups are >on the older 30mb and 60mb cartridge tapes that we don't even have devices >for any longer... > >Vincent is the world's worst about his proofs of anything. His general >"proof" goes like this: > >I can prove that X can't have happened. Here is the proof: > >X can't have happened. > >Doesn't float my boat... :) Classic. BTW, I was going to write a log eater in gawk, but haven't got it done yet. (Also, I'm still trying to figure out how to get gnuchess to produce a log in the first place. The man page says one thing, but the engine won't do it for some reason. I may give up and use Phalanx22 instead.) I've been running some test games with stronger versus weaker programs, but giving the weaker faster hardware. I want to see if an n% depth-searched advantage holds from shallow to deep searches limits. I.e. no matter how deep we are searching, engine A searching 15% (or some %) deeper than engine B always produces the same rusults statistically (or not). If so, then one might be able to take engine vs engine test results, and calculate how much speed they would need to reach parity/superiority with a competitor. I could see how this could maybe break, though, since some programs might dynamically change their search strategy at greater depths, in effect becoming a different engine. I don't know. But I need a log eater to do the analysis. Should be pretty easy.
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.