Author: Peter W. Gillgasch
Date: 12:05:33 01/18/98
Go up one level in this thread
On January 18, 1998 at 14:22:47, Robert Hyatt wrote: >On January 18, 1998 at 13:36:38, Ernst A. Heinz wrote: > >>On January 18, 1998 at 10:56:30, Robert Hyatt wrote: >>>On January 18, 1998 at 09:47:40, Ernst A. Heinz wrote: >>>>On January 18, 1998 at 07:36:26, Peter W. Gillgasch wrote: >>>> >>>>>00:01:00 6122978 nodes NPS: 101710.598007 >>>> >>>>Hi Peter, >>>> >>>>in terms of NPS "Chess Demon" seems to be hellishly fast indeed -- >>>>congratulations! >>>> >>>>But what happened to your tree size? The current "DarkThought" needs >>>>only 3.8 million nodes to complete iteration #11 of WAC #3. >>>> >>>>=Ernst= >>> >>>Could be explained by lots of things... >> >>Sure, I know that there are many plausible explanations. I just wanted >>to hear one from Peter himself. :-) >> >>As far as I know him, Peter is an NPS addict. Thence, it is also >>possible >>for "Chess Demon" to be severely hampered in one way or the other in >>order >>to achieve very high NPS numbers. That's why I wondered about tree size. >> >>=Ernst= > > >tell him to toss his move ordering out the window, and get rid of >alpha/beta. >Node counts will be phenomonal. :) First, this guy can't tell me anything. Second, I am using SEE pruning, square safety considerations, I nearly don't generate illegal moves, I use PVS, hashing etc. Just because I am below 600 clock cycles per node without any assembly at all doesn't mean that I wrote a loop the increments the node count only :) I am finding the solution at iteration 3, Bob at iteration 6. Go figure. For further details, well, I am sure that one of you two would make a paper out of them, so I won't tell you that this time 8^) Live and learn :) -- Peter
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.