Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Could Programmers here working together simulate DB's Knowledge??

Author: Otello Gnaramori

Date: 05:57:56 11/18/01

Go up one level in this thread


On November 18, 2001 at 08:49:06, Uri Blass wrote:

>On November 18, 2001 at 08:13:48, Jesper Antonsson wrote:
>
>>On November 18, 2001 at 05:06:24, Otello Gnaramori wrote:
>>>>Otello, there is not enough information available for you to make such claims.
>>>
>>>Please see my answere here :
>>>http://www.icdchess.com/forums/1/message.shtml?197927
>>
>>Well, you don't show anything there to back up the claims that their algorithms
>>are outdated. No new revolutionary algorithms have been presented that would
>>make DBs outdated,
>
>It is known that DB did not use the null move pruning.
>The null move pruning was known in 1997 but they did not use it.


Uri , you anticipated me for few minutes...I was just going to write the same
matter on null move forward pruning...

>
> and how complex/good their eval is we don't know. Since they
>>could make complex eval for free in hardware, it might just be much better than
>>todays micros.
>
>I do not believe that it was better than today micro.
>I analyzed the games andthe fact that deeper blue could not see Qe3 in the pv of
>game 1 suggest that their search rules and their evaluation was inferior.
>
>I saw no evidence for a move that top programs of today need a long time to find
>and other people also analyzed the games and found no evidence for it.
>
>It seems that every move in the games can be played after some minutes by one
>of the top programs(not always the same program).
>
>>
>>Perhaps a real expert may be able to say something about this if he was to
>>scrutinize the DB moves in the last match and compare them to the moves Fritz
>>would make if given a lot of extra time. But it would be hard to be fair there,
>>since "nodes" aren't equal.
>>
>>Regards,
>>Jesper

Well, Uri is a real expert and did the analysis , so you get what you wanted.

>
>My impression based on analysis that Deeper blue was only 2-3 times faster than
>Deep Fritz on p800 in some cases because deep Fritz was 2-3 times slower in
>finding similiar pv to Deeper blue.
>
>There are logfiles of the games of the last match deeper blue-kasparov so it is
>possible to check it.
>
>Uri



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.