Author: Tom Likens
Date: 07:27:34 03/17/04
Go up one level in this thread
On March 17, 2004 at 09:52:27, Tord Romstad wrote: >On March 17, 2004 at 04:58:06, Peter Alloysius wrote: > >>what are tricks for evaluation tuning so that it could >>search less nodes? > >An easy way to reduce your tree size enormously is to evaluate all >positions to the value 0. You will get beta cutoffs at the first move >everywhere in the tree, therefore the tree will be extremely small. Your >move ordering will always be perfect, and the simple evaluation function >will certainly boost your nodes/second count. :-) > >Seriously, I don't think tuning the evaluation is the right way to go >in order to reduce the tree size. You should rather concentrate on >making the evaluation function as accurate as possible, and look for >improvements in your search and move ordering when trying to reduce the >size of your tree. > >Tord Ah ha!! I knew there was a final *secret* you weren't sharing Tord, but now the cat is out of the bag. After reading this I've replaced my evaluation function completely with... return 0; and it has *never* been faster. --tom P.S. And please, no comments of, "but, Tom considering the way your engine plays, we'd always assumed your evaluation function consisted of nothing but "return 0" ;-)
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.