Author: Robert Hyatt
Date: 12:52:28 08/27/02
Go up one level in this thread
On August 26, 2002 at 17:23:30, Dann Corbit wrote: >On August 24, 2002 at 18:30:18, Alvaro Jose Povoa Cardoso wrote: > >>On August 24, 2002 at 17:19:21, Georg v. Zimmermann wrote: >> >>>On August 23, 2002 at 14:41:11, Dann Corbit wrote: >>> >>>>http://www.talkchess.com/forums/2/message.html?41900 >>> >>>Mr. Schroeders post is very interesting. The idea he describes though is just >>>another way to do internal iterative deepening. >>> >>> >>>Georg >> >>Is this applied to _every_node_ witch has no best move from the hashtable? > >Not in the qsearch But what about _all_ the non-qsearch nodes that have no hash table move? IE some 70% of the typical positions fall into this category.
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.