Author: Uri Blass
Date: 02:50:58 10/19/02
Go up one level in this thread
On October 18, 2002 at 23:21:17, Steve Lim wrote: >ICC will be conducting a 2nd and probably final interview with DB's Hsu on Sat >12 pm. After the final Kramnik vs DF game. > >This interview is meant to be more technically inclined. So I will try to give >technical questions priority. The format of the interview will be the same as >the last one. Questions are to be submitted to a moderator and relayed to him to >be answered. > >Please post your questions here and I will add them to the list. > >Thanks. > >Steve aka SJLIM Here is a list of my questions: please answer yes or no for questions 1 and 2. 1.Does the 12 plies brute force depth of deeper blue means no pruning or can it include pruning in the hardware? 2.Does 12 means that the depth of the software in deeper blue was less than 12 plies(12-x when x is the depth of the hardware that is not constant)? 3.What is the estimate for the total number of chess positions that deep blue searched in one second (not the effective number of nodes) 4.What is your estimate for the eqvivalent number of nodes in normal pc to get the same results of deeper blue if we assume the same evaluation and the same extension rules and no problem of ordering moves in the last plies. Is 126M the right number or less than it? 5.Could deeper blue find Qe3 in game 2 against kasparov and how much time did it need to do it? How much time did it need to find Kh1 instead of Kf1 in game 2 (a move that the top programs of today have no problem to find)? Uri
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.