Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Searching 18-20 ply just using nullmove

Author: Dann Corbit

Date: 20:35:50 08/17/00

Go up one level in this thread


On August 17, 2000 at 23:29:49, Vincent Diepeveen wrote:

>On August 17, 2000 at 23:22:27, Dann Corbit wrote:
>
>>Can you achieve this depth at tournament time controls (on average) for all the
>>positions in a game?
>>
>>Can you achieve this depth at tournament time controls (on average) for the
>>opening positions?
>>
>>Can you achieve this depth at tournament time controls (on average) for the
>>middle game?
>>
>>By tournament time controls, of course I mean 40/2
>>
>>If you are able, then I think this really is something incredible!
>
>Of course i can't do that at tournament level yet.
>I don't get a billion nodes yet totally at 40 in 2!
>
>My claim was 'several' billion nodes.
>
>So give me a game, and i'll let it analyze after WMCC at each
>move over a night.
>
>It's a matter of a short period of time and what you see after a full
>night of analyzes now, you will see then at tournament level.
>
>Bigger hashtables and better evaluation and better sorting and
>search efficiency will only make searches deeper with less nodes as
>DIEP uses now.

Assuming a doubling of CPU power every year, how long until Diep can achieve 18
plies on average at 40/2?



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.