Author: Robert Hyatt
Date: 14:38:38 12/25/99
Go up one level in this thread
On December 25, 1999 at 14:11:11, Dan Andersson wrote: >On December 25, 1999 at 11:48:38, Robert Hyatt wrote: > >>On December 25, 1999 at 07:03:50, Dan Andersson wrote: >> >>>>Also remember I reported that they did a new modification to this extension >>>>for DB-2... if there was one singular move, they extended as in the JICCA >>>>article. If two moves were better than the rest, they extended each, but not >>>>as much as when there was only one singular move... >>>> >>> >>>Thats not all new btw. When you mentioned it first I got a bit surprised as I >>>had a test implementation of someting that sounded very similar. In my library >>>of machine readable texts I then found my inspiration. There is a paper named: >>>Alpha-Beta-Conspiracy Search (Draft of Oct. 20, 1993) by >>>David A. McAllester & Deniz Yuret. Could be worth reading. They used two depths >>>black/white. >>> >>>Regards Dan Andersson >> >> >>I had read that. However the 'conspiracy number search' isn't quite the same >>thing. The point there is to determine how many nodes (below some point in > >Ahem, you better read that paper again. 'Alpha-Beta-Conspiracy Search' is an >implementation of Alpha-Beta search, not Conspiracy Number search. They then >prove a similarity betwen ABC search and CN serch. In that case, I will. I might have the name confused with a pure CNS paper or two that I have read within the last couple of years... Bob > ><IGNORETHIS> >>the tree) much change their value before it affects something back up in the >>tree. The ideas are similar, but not exactly the same... >> >>And you are right, the CNS can be used to extend cases where if one move >>changes, the tree above that position changes, or if it takes two moves to >>change to back up a new score... etc... ></IGNORETHIS> > >Regards Dan Andersson
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.