Author: Dave Gomboc
Date: 00:45:51 06/22/99
Go up one level in this thread
On June 21, 1999 at 21:49:44, Dann Corbit wrote: >On June 21, 1999 at 20:56:01, Dave Gomboc wrote: >[snip] >>You already have the leaf values computed, so the proposed algorithm is >>inefficient. Simply do a depth-first search (with cycle detection) and backup >>scores in a minimax fashion. Now it takes one pass through the items. >Is minimax valid when we have missing data points? I don't want to have to >generate the billions of missing nodes. > >I could use Alpha/Beta cutoff, for that matter (if it works). Keep track of the computed score for a position separately from the backed-up score for a position. If they differ significantly, an important alternative was overlooked. Dave
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.