Re: GNU Chess ratings estimates...

Thread View: gnu.chess

6 messages

[T] Back to Threads [V] Tree View [G] Group Articles

6 total messages Started by Benjamin Sloss Tue, 29 Dec 1992 17:07

#168

Author: Benjamin Sloss
Date: Tue, 29 Dec 1992 17:07

38 lines
2672 bytes

Tony-Preston@cup.portal.com (ANTHONY FRANCIS PRESTON) writes:
>I have the Amiga version of the GNU chess program and think it is pretty
>good.  My questions are 1) what are the estimates for rating strength(USCF?)
>versus the various time controls?  2) how deep will the search for moves
>go versus the time controls.  I am only looking for intellegent estimates!

  To estimate the strength of the program, it is necessary to know how fast
the program runs on your hardware.  Perform the following test:
* With the book turned off, set the time controls to some long interval
(say move/10 min) and set the search depth to 6 ('depth' <cr> '6' <cr>)
Turn on 'post' and then type 'go'.  Record the time it takes your machine
to calculate the 6-ply search for White's first move (it should get Nf3).

  Now, we need to make two assumptions.  The first is fairly well established:
every doubling of processor speed improves the program's play by roughly 75
points.  The second is a baseline rating for GNUChess, which I will 
estimate as 2300 on an RS/6000.  

  The RS calculates the search in 27 sec.  Thus, you can estimate the rating
of GNUChess on your Amiga by the formula 2300 - 75 * (log2(t) - log2(27))
where t is the number of seconds it took your machine to calculate the
search.

  In answer to your second question (depth of search vs time), the answer
depends greatly on the type of position being searched.  Endgames, with their
reduced piece count (and thus reduced movelist) are searched much deeper than
complicated middlegames, in a given amount of time.  Perhaps a more useful 
question is "my program searched n ply in time t; how long will it take
to search n+1 ply?".  The answer here is about 6t for middlegames, and
perhaps 3t for endgames.  This is again due to the differences in movelist
size (which averages 40 in the middlegame, much less in the endgame) and
the effeciency of the alpha-beta pruning algorithm.

-- 
Ben Sloss        Email: ben@osc.versant.com   Work: (415) 329-7500 x172
Quote:          "It's all fun and games until someone gets paid."
Transportation: '83 CB650SC (straight roads) '93 CBR 900RR   (twisty roads)
		'91 XR 250L (dirty    roads) '87 Mustang 5.0 (wet    roads)

Re: GNU Chess ratings estimates...

#170

Author: Tracy Monaghan
Date: Wed, 30 Dec 1992 00:04

9 lines
907 bytes

Thanks for the formula for estimating GNUchess strength, but...

For those of us who are mathematically-deficient, is there a formula
which doesn't use log2 but makes use of log10, or ln (natural log), or
barring that, some fanciful way of achieving log2 using log10 and/or ln?

Or, if someone just happens to know the estimated rating of GNUchess 4pl60
on a DECstation 3100...

Steve Martin: Fischer fan

#171

Author: Jeffrey C. Ely
Date: Wed, 30 Dec 1992 00:26

3 lines
705 bytes

The San Francisco Chronicle tells me that Steve Martin, in an interview in
Playboy, admits to having asked for only three autographs in his entire life.
One of the three was Bobby Fischer, whom he calls " a legendary genius."

Re: Steve Martin: Fischer fan

#174

Author: Rob Hoffmann
Date: Wed, 30 Dec 1992 09:07

6 lines
878 bytes

In article <1hqqb0INNej7@agate.berkeley.edu>, jeff@emily10.Berkeley.EDU (Jeffrey C. Ely) writes:
> The San Francisco Chronicle tells me that Steve Martin, in an interview in
> Playboy, admits to having asked for only three autographs in his entire life.
> One of the three was Bobby Fischer, whom he calls " a legendary genius."

Allright, but does Steve Martin play a decent game of chess?

Re: GNU Chess ratings estimates...

#175

Author: Larry Loen
Date: Wed, 30 Dec 1992 22:59

32 lines
1797 bytes

In article <1hqp39INNilh@shelley.u.washington.edu>, monaghan@cac.washington.edu (Tracy Monaghan ) writes:
|> 
|> Thanks for the formula for estimating GNUchess strength, but...
|> 
|> For those of us who are mathematically-deficient, is there a formula
|> which doesn't use log2 but makes use of log10, or ln (natural log), or
|> barring that, some fanciful way of achieving log2 using log10 and/or ln?
|> 
|> Or, if someone just happens to know the estimated rating of GNUchess 4pl60
|> on a DECstation 3100...

The conversion is available in a lot of mathematics books.  If memory serves,
converting works as follows:

     x = log to base 2 of (some expression or other).

    x*ln(2)/ln(10) produces the value of x as a base 10 logarithm.    

    If y is not "logged" yet.  That is:

     y  =  (some expression or other)

    then the base 10 logarithm is it is ln(y)/ln(10)

where "ln(z)" is the natural log of z.


Anyway, that's what MS DOS basic shows me.

-- 
   Larry W. Loen        |  My Opinions are decidedly my own, so please
                        |  do not attribute them to my employer

Re: GNU Chess ratings estimates...

#177

Author: Jim Fougeron
Date: Thu, 31 Dec 1992 04:58

12 lines
961 bytes

monaghan@cac.washington.edu (Tracy Monaghan ) writes:


>Thanks for the formula for estimating GNUchess strength, but...

>For those of us who are mathematically-deficient, is there a formula
>which doesn't use log2 but makes use of log10, or ln (natural log), or
>barring that, some fanciful way of achieving log2 using log10 and/or ln?

log2(x) == (log10(x))/(log10(2))

Jim Fougeron jefouger@nyx.cs.du.edu

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads