Author: Uri Blass
Date: 14:37:14 08/21/02
Go up one level in this thread
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
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.