Author: blass uri
Date: 12:53:31 03/03/00
Suppose you have a program with evaluation of 0.00 for every position so the order of moves is always perfect. Suppose this program does no prunning and no extensions. What is the branching factor of this program and how many nodes does it need to search to get 17 plies in the positions that deeper blue is supposed to get 17 plies with no prunning and a lot of extensions? It seems to me that it is impossible with no hash tables to get 17 plies in 3 minutes even if you can search 200,000,000 nodes/second,have a perfect order of moves and do no extensions. Hash tables can help to reduce the branching factor but how much do they help? I have also 2 questions about hash tables: 1)Can hash tables help to reduce the branching factor when they are full? 2)What is the size of the hash tables that deeper blue used? Uri
This page took 0.01 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.