Author: Dan Andersson
Date: 08:51:58 06/06/01
Go up one level in this thread
It's almost useless to speculate. I can only say that the increased nodecount due to re-search is almost always more than recouped by the more efficient search. And I use ETC to make use of the Hashtable real efficiently. If my search returned really unstable values that might not be the case (I have a lot of non material terms that are valued high. But as long as the search is in PV or as long as the underlying structures of the positions searched (as they will often be in the meaningful part of the search) are the same their rate of change will be slow.). I find MTD(f) faster over the whole game, and in the endgame it can be a real worldbeater. YMMV. Regards Dan Andersson
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.