Author: Bruce Moreland
Date: 22:38:04 09/27/98
Go up one level in this thread
On September 26, 1998 at 17:30:09, John Coffey wrote: >This is an interesting question, because Robert Hyatt told me the other day >that it was the size of the tree and not the NPS that really matter. When >I looked at the Crafty source code, I was surprised at how much code that >gets executed for every single node. But the main purpose of that code is >to cut down the size of the tree (using null moves, hash tables, move ordering, >etc.) That tree grows exponentially, so cutting it from say 6^N down to 3^N >is a huge improvement regardless of the number of nodes per second. You could spend a relative eternity on each node near the root of the tree, and if you only got a few percent reduction in tree size it would be a win. Out near the tips you have to be a more careful. bruce
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.