Author: Robert Hyatt
Date: 20:48:22 09/01/01
Go up one level in this thread
On September 01, 2001 at 12:34:24, José de Jesús García Ruvalcaba wrote: >Sorry about beggining a new DB thread. A simple fact that has been overlooked in >the latest arguments is that the tree size for DB can not be compared to the >tree size of other programs, because >-the hashtable handling is completely different (as Vincent has already pointed >out). >-even more stunning DB does not even use alpha-beta pruning (it does not use a >straight minimax or negamax either). >José. Not sure what you mean by that last part. The software part of DB's search is pure alpha/beta. The hardware uses a trick of only handling one bound. It is not much worse than normal alpha/beta...
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.