Author: Paul Richards
Date: 11:19:26 06/22/99
Go up one level in this thread
On June 22, 1999 at 12:05:17, Paul Richards wrote: >On June 21, 1999 at 20:56:01, Dave Gomboc wrote: > >>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. > >Could you explain this in English please? ;) I'm sure if I knew the what >a depth-first search with cycle detection was or the details of minimax >this would make perfect sense. ;) Never mind, I followed the nice links in the resource center myself. :)
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.