Author: Vincent Diepeveen
Date: 16:22:15 08/21/02
Go up one level in this thread
On August 21, 2002 at 17:37:14, Uri Blass wrote: >On August 21, 2002 at 17:31:53, Uri Blass wrote: > >>On August 21, 2002 at 17:21:08, Robert Hyatt wrote: >> >>>On August 21, 2002 at 14:48:04, Vincent Diepeveen wrote: >>> >>>>On August 21, 2002 at 14:42:49, Robert Hyatt wrote: >>>> >>>>Bob if you don't read what they write, >>>>then please show us you can do math. >>>> >>>>Please quote what is the theoretic number to search FULLWIDTH without >>>>hashtables OR killermoves and WITH singular extensions a treesize >>>>of 18 ply.. >>>> >>> >>>First, they don't claim to do "fullwidth" in the hardware. >> >>The 12.2 is software+hardware depth. >>It is very clear from their paper. >> >>see page 13 table 2 >> >>iteration 12 >>minimum software depth 8 >> >>The explanation say that is it about the position before white's move >>in game 2 against kasparov. >> >>Uri > >They also explain "given iteration i the software is assigned i-4 ply" >In the examples the maximal depth is only 40 plies and top programs of today >have no problem to get that maximal depth. > >Uri The fact that this has been written clearly by the deep blue team in 2001 (august) and published in if i remember well artificial intelligence, it clearly indicates that they were a bit sick of the confusion as well and very clearly wrote down what the thing did and was. We can only thank them for doing so.
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.