Author: Robert Hyatt
Date: 07:21:00 09/05/02
Go up one level in this thread
On September 05, 2002 at 00:16:22, Dave Gomboc wrote: >>I did point out that the number he printed was always "low". And told him >>to run crafty with mt=2 in console mode and occasionally type a ".". For >>a good while the nodes searched won't change, even though you _know_ it is >>searching. Then, suddenly, the node counter will jump significantly as the >>values get backed up and the nodes get collected and added. He is making >>his judgement on a value that has not been updated recently. I told him >>how to see this in the code, but do you think he is going to let a logical >>explanation get in the way of his powers of "deduction"? Not likely. :) > >Anyone who has ever spent any time with an SMP crafty and Winboard has seen this >behaviour. Sometimes the node count doesn't get updated for a long time, then >"boom", it goes way up. > >Dave I know. But that doesn't stop vincent from posting the numbers, sometimes right before they go "boom". And that can let you prove most anything you want, using his definition of "prove". We had the same issue in Cray Blitz, but fortunately we didn't have people like him running the program and adding code to dump values that were simply no good... and then using that to prove that the parallel tree was always smaller than the serial tree. I don't try to prove things by fiddling with other programs. I don't consider myself knowledgable enough to make changes without a _lot_ of study. Which means that I usually fiddle with _my_ code that I know blindfolded, so I won't make simple errors and go off on a wild-goose-chase.
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.