Author: Dan Andersson
Date: 14:08:35 08/09/01
Go up one level in this thread
I think it might be my brainstorm. In that case it meant making a one ply search from a node and apply ETC to all end nodes. It isn't meant as a playing enhancement, it might be usable really close to the root. But instead it's a try to get a better lower bound on the minimum graph than ETC-AB search. In reality the minimum number of nodes needed to search to a certain depth is much lower that estimating the perfectly ordered A-B search due to the graph properties of the search space. I recommend reading Aske Plaat's papers about search. MvH Dan
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.