Computer Chess Club Archives

Search

Messages

Subject: Missing masses of information and Minimax musings

Author: Dann Corbit

Date: 18:49:44 06/21/99

Go up one level in this thread

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).

• Re: Missing masses of information and Minimax musings Dave Gomboc 00:45:51 06/22/99
  • offline opening book learning Jay Scott 10:17:35 06/22/99
    • Re: offline opening book learning Dave Gomboc 11:32:26 06/22/99
      • Re: offline opening book learning Jay Scott 08:54:22 06/23/99
        • Re: offline opening book learning Dave Gomboc 09:08:11 06/23/99

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.