Re: Using partial plys

[Tristan Cazenave <cazenave@xxxxxxxxxxxxxxxxx>]

David Fotland wrote:

>  What information is stored for each search node
> >and how is this information used to update ancestor nodes and direct the
> >search.
>
> The result (win, win-likely, ko, unknown, lose-likely, lose), the
> confidence (0 to 100), the confidence of the most refuting node below
> this one, has this node been evaluated.  Confidence values are passed
> toward the root, using the usual probability formulas.
>

Is there any similarity with B* Probability Based Search?
It is a best first algorithm that also use probabilities.
Put another way: what are the differences ?

--
Tristan Cazenave
Universite Paris 8, Laboratoire d'Intelligence Artificielle
2, rue de la Liberte 93526 Saint-Denis Cedex - France
http://www.ai.univ-paris8.fr/~cazenave/