Computer Chess Club Archives


Search

Terms

Messages

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

Author: Ricardo Gibert

Date: 05:33:32 01/31/02

Go up one level in this thread


On January 30, 2002 at 12:11:16, Robert Hyatt wrote:

>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
>>
>>[..]
>>
>>
>>Greetings
>>Alex
>
>
>You are right.  Wasn't thinking clearly at the time, obviously.
>:)
>
>Bob

But at the time, you must have thought you were thinking clearly or you surely
would not have made the post. This raises the question of, "How do you know you
are thinking clearly now?" ;-)

Nothing "obvious" about it, yes?

Setting aside my stupid jokes, the serious question now is: "Isn't 2^34 a bit
too big for Deep Blue?"



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.