Author: Robert Hyatt
Date: 17:23:42 01/22/00
Go up one level in this thread
On January 22, 2000 at 20:19:19, Robert Hyatt wrote: There is another way to handle this that might be better against humans: Do a minimax search to some depth, but probe the tablebases at each ply. Make the static eval return something like N-sum(opponent's non-losing moves). The idea is that you would like to follow branches where the opponent has only one non-losing move at several points, hoping for one blunder to lose the game for him. I had code written for this, but never really finished testing it as the current approach is simpler...
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.