Author: Ulrich Tuerke
Date: 08:02:49 01/15/02
Go up one level in this thread
On January 15, 2002 at 08:51:26, David Rasmussen wrote: >On January 15, 2002 at 08:45:21, Severi Salminen wrote: > >>>Many people use node count (or time) to order root nodes, apart from always >>>ordering the pv move of last ply first, of course. This seem to work ok. But as >>>some people have suggested (Christophe, for one), this method isn't very much to >>>the point and might have unwanted sideeffects. >> >>How is it "not to the point" and what side effects he means? For me it works. >> >>Severi > >It works for me too. > >The phrases "not to the point" and "side effects" are mine, not Christophe's. >But he has expressed similar things. > >When I said "not to the point", I meant that 'nodes used' is not a very direct >measure of the quality of a move, it's rather an indirect one. If I somehow >could get the score of each root move after an iteration, I would certainly use >that for ordering, but I can't since I use PVS. > >I can't name any tangible side effects, I said it "might" have side effects. > >/David One of these is for instance, that you will always have heavily extended moves early in your list. They aren't necessarily good and possibly you waste a lot of time until you come to - perhaps better and less expensive - less extended moves. Uli
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.