[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

computer-go: re: perfect play



 
 > > *** First, I think it is obvious that perfect play is not possible without
> > knowledge of the full game tree. This knowledge can be explicit
> > or implicit
> > (as in "my dad analyzed the position from here and told me this is the
> > winning sequence"). Even if some shortcut may exist, for it to indubitably
> > be "perfect" it has to be based on someone's analyze of the full tree.
> >
> <snip>
 
> Isn't alpha-beta pruning a refutation of this?

I think it would be, if the evaluation function was proven to be "perfect". But a "perfect" evaluation function does imply an implicit knowledge of the result of any game continuing fom the current position - i e the full game tree. And only one ply of search would be enough...

/Vlad