Author: Inmann Werner
Date: 02:39:54 08/24/99
Hello all! I am again trying to tune my program, and came to some questions. 1) What to do with fail lows and hashing. Put them in for move ordering? I think no. Put them in for hash hits? I do, but I am not sure, it is good. If I get a hash with fail low flag I check, if it is again a fail low and only then I use it. That makes a cuttoff for easy, not disturbing? But in positions, i get differences, if I use fail low hash hits. Not much, but...? What do you think about doing best? 2) 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? Werner
This page took 0.01 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.