Author: Steve Maughan
Date: 21:30:46 04/06/99
Go up one level in this thread
Thanks for the input! >>Another idea, which may very well be bad, would be to ignore the whole problem >>and simply search some moves twice. That sounds expensive but I guess the hash table 'should' make a cutoff at the next ply. >Yeah; I tried this and it was terrible. Because the first move chosen was >usually close to the best, it would take a while to cut it off.... Hmmm - yes sounds bad. What do others actually do? Steve Maughan
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.