Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: ply search vs elo rating - proposed formula

Author: Jeremiah Penery

Date: 10:14:55 10/22/99

Go up one level in this thread


On October 22, 1999 at 08:56:21, blass uri wrote:

>On October 21, 1999 at 16:05:36, Jeremiah Penery wrote:
>
>>On October 21, 1999 at 14:23:59, Dave Gomboc wrote:
>>
>>>On October 21, 1999 at 09:19:11, Jeremiah Penery wrote:
>>>
>>>>DB has a lot more knowledge than Hiarcs does.  Also, DB was searching a lot more
>>>>than the 14-ply that Joshua was saying - it searched 14 + 30(+) ply in most
>>>>interesting lines.  It's really difficult to determine an accurate 'depth' most
>>>>of the time, because for each program it will be different, based on the number
>>>>of extensions done.  Hiarcs probably extends more than most other micro
>>>>programs, but DB does a lot more even.
>>>
>>>IIRC, Amir once said that Junior extends even more aggressively than DB.
>>>Unfortunately, he didn't get any quantitative evidence or examples.
>>
>>I think that common sense can show that this can't be true.
>>
>>At 200M NPS, why was DB getting 'only' 12-14 ply in 3 minutes/move?  The reason
>>is that all the rest of it was extensions.
>>
>>At 200k NPS (or whatever it is Junior gets - Even at 400k, it is still 500x
>>slower than DB), how many ply can it get in 3 minutes/move? 10 ply? 11? (I
>>really don't know, so someone please enlighten me. :)
>
>
>From my experience it usually does not do more than 8 plies brute force in
>middle game positions.
>It may need some hours to get 10-11 brute force plies depth.

I guess I stand corrected. :)  Thanks.

Jeremiah



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.