Computer Chess Club Archives


Search

Terms

Messages

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

Author: David Rasmussen

Date: 11:05:51 01/30/02

Go up one level in this thread


On January 30, 2002 at 11:01:18, Gian-Carlo Pascutto wrote:

>On January 30, 2002 at 10:55:35, Vincent Diepeveen wrote:
>
>>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
>
>The branching factor is _directly_ related to the number
>of nodes needed to search to a certain depth.
>
>Funny how you constantly ignore counterarguments so you
>can keep spewing out nonsense at a greater rate.
>
>--
>GCP

There is nothing that implies that Deep Blue had especially good branching
factor. Hsu was a firm believe in sound searching and hated things like null
move pruning etc. I've heard extensions mentioned (specifically singular
extensions) regarding DB, but never forward pruning, which is the only way to
get a significant cut in branching factor.

/David



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.