Author: Dave Gomboc
Date: 20:34:56 09/18/01
Go up one level in this thread
On September 18, 2001 at 09:10:02, Vincent Diepeveen wrote: >This refers to the fact that YBW for each node needs a result for the >first move first before splitting other moves. Now this is of course very >true, but this directly also shows that APHIDs branching factor is by >definition bigger than algorithms which use YBW. So what? Minimising the branching factor is only a sub-goal. The real goal is to get the best search results. APHID does some re-search to avoid waiting because Mark found that overall performance was better that way. I suggest you ftp a copy of his thesis, which will have newer information than anything published in Advances in Computer Chess. 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.