Author: Sune Fischer
Date: 08:02:15 04/06/03
Go up one level in this thread
On April 06, 2003 at 09:56:42, Dan Andersson wrote: > To get a better understanding of the problem domain you should read the papers >linked from: http://www.talkchess.com/forums/1/message.html?291984 > >MvH Dan Andersson Is there something wrong with my understanding? He asked if someone had done this in their program, I assume he is asking for an algorithm or method to do it. "For actual games, where the game tree is nonuniform, the minimal tree is usually taken to be the alpha-beta best-case." Perhaps you should read your links yourself :) -S.
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.