Re: Using partial plys

["P.J.Leonard" <P.J.Leonard@xxxxxxxxxx>]

Tristan Cazenave wrote:
> 
> 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 ?

 I did look into this a while back.  B* is more complex than
PN it uses probabilities, optimistic, pessimistic and real
values. A good paper is 

 "Hans J.Berliner"  B* Probability search.

ftp://ftp.bath.ac.uk/pub/eespjl/pubgo/BSTAR.ZIP

(is it OK to put other peoples papers on your own ftp site ?)



B* appears to use a VERIFY and REFUTE phase of search, this may 
be similar to the refute /proof numbers of the PN search. In the 
B* the 2 stages are performered sequentially whilst in PN they
occur in parallel.

Sorry my memory is not good enough to remember any more details. 


-- 
 Cheers Paul.                                        
               __         __                  
              (  ) _ - _ (  )                 
               ~~         ~~                  
                (  0   0  )                   
----------ooO----(       )----Ooo------------ 
          '''     (     )     '''             
                   (   )                      
                    \ /                       
                   ~~O~~                      

  Tel: +44 1225 826108
  Fax: +44 1225 826305
snail: P.J.Leonard
       Applied Electromagnetic Research Centre
       Bath University,
       BATH, UK   BA2 7AY