Author: Dave Gomboc
Date: 19:00:25 02/01/02
Go up one level in this thread
On January 30, 2002 at 18:21:53, Tony Werten wrote: >On January 30, 2002 at 14:15:32, Dann Corbit wrote: > >>On January 30, 2002 at 14:00:32, David Rasmussen wrote: >> >>>On January 30, 2002 at 09:43:49, Vincent Diepeveen wrote: >>> >>>I don't know anything about what Bob has stated, but I agree that 18 ply >>>fullwidth was/is impossible, even with 200 Mn/s. >>> >>>Please email me how you do singular extensions, Vincent. :) >> >>I've done 18 ply searches with a PC. What makes you think it is impossible for >>a machine that can peak at one billion nodes per second? >> >>They did not use null move, but neither did they blindly search the whole tree. > >I'm very sure you didn't get 18 ply fullwidth. > >They had a branching factor of 4. You don't get 18 ply with that. Either you >don't have that BF (pruning) or you don't get 18 ply ( just some extensions do) > >Tony Their software search was not pure BF. Dave
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.