Computer Chess Club Archives


Search

Terms

Messages

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

Author: Vincent Diepeveen

Date: 07:55:35 01/30/02

Go up one level in this thread


On January 30, 2002 at 10:28:19, Kevin Strickland wrote:

>And also remember Diep wins everything blindfolded.
>
>You might be right about that. Bob might be right about his statements.
>
>Does anyone _really_ care about this anymore?

Kevin, bob has a small problem defending deep blue as
40^9 is such an incredible number of nodes needed, that you
must not confuse it with the 'branching factor' which bob
uses. branching factor is something entirely different than
total number of nodes. branching factor only says how much it costs
in software to get 1 ply deeper, but in reality never the 480
processors start to search at once of course. Good examples are
programs like Zugzwang at 512 processors, before *some* processors
started to search we were 30 seconds further.

Deep Blue had 480 chess processors, very well comparable number to 512.

the branching factor bob is further also influenced by hashtable entries
in the software part which can get reused.





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.