Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Mathematical impossibilities regarding Deep Blue statements by Bob,

Author: Vincent Lejeune

Date: 08:24:56 01/30/02

Go up one level in this thread


On January 30, 2002 at 11:00:58, Alexander Kure wrote:

>On January 30, 2002 at 10:25:41, Robert Hyatt wrote:
>
>[..]
>
>>You can make up all the math you want, but it doesn't prove anything.  I
>>_know_ that DB's branching factor was roughly 4.0, as was discussed _here_
>>a few years ago after several of us looked carefully at their logs.
>>
>>to go to depth 18 requires 4^17 as many nodes as searching to one ply.
>>4^17 = 2^18, = 262,000 roughly.
>
>4^17 = 2^34

NO 8
>
>[..]
>
>
>Greetings
>Alex



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.