Computer Chess Club Archives


Search

Terms

Messages

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

Author: Dann Corbit

Date: 11:56:00 01/30/02

Go up one level in this thread


On January 30, 2002 at 14:47:42, Uri Blass wrote:
[snip]
>Yes but I understood that Deeper blue did not use pruning except maybe qsearch
>and most of the nodes in the tree are not qsearch nodes.

On whose testimony do you base this assumption?



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.