Re: [computer-go] Pattern matching - example play

[Erik van der Werf <e.vanderwerf@xxxxxxxxxxxxx>]

Here's a rough estimate for PVS with TT and decent move ordering.

(sqrt(82)/2)^9 = 800k

E.


Chris Fant wrote:
>  > > > 9 ply full width on 9x9?  Certainly not near the beginning of the 
> game.
>  > >
>  > >It depends on the time settings. For tournament play it was probably a
>  > >bit less in the opening and a bit more towards the end.
>  >
>  > With nullmove R=3 and some selectivity and good hashtables you should 
> get
>  > far deeper depending upon the total nodes you see.
>
> Obviously when you start pruning you can get deeper.  Did I just
> imagine the phrase "full width"?  No, I think it was actually in the
> original email.  Sqrt(81 perm 9) = 308E6 leaf nodes to evaluate for
> the first move of the game.  Symetry and a transposition table both
> reduce it by some uncalc-able (by me) amount.  But my point is that
> "full width" does not mean "add your favorite move selection heuristic
> for tree pruning".  I am by no means an expert on search, I just
> believe in preserving the meaning of a given terminology.
> _______________________________________________
> computer-go mailing list
> computer-go@xxxxxxxxxxxxxxxxx
> http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/