Author: Shep
Date: 06:02:28 08/24/99
Go up one level in this thread
On August 24, 1999 at 05:39:54, Inmann Werner wrote: >It disturbed me, that in some not clear positions the search often switches, and >that only for 1 point better (1/100 pawn) which is not real relevant, but costs >much time cause of the research. >So I thought about making the eval result not so perfekt (score=(score/2)*2). >Now it switches not so often, but in "normal" positions needs more nodes (less >cutoffs?). > >Is this idea dumb or worth thinking about it. >Makes a small evaluation, where much values of different positions give the same >value the search slow? While I can't comment on technical details, I wanted to note that I know at least one top-strength program (Chess Tiger) where this situation (new move found with eval difference 0.01) happens quite often. Of course it's possible that this will hurt if your evaluation is not yet at that level of strength. --- Shep
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.