RE: [computer-go] Spiral pattern matching and data structures

["Anders Kierulf" <anders@xxxxxxxxxxx>]

> None except it turned out to be faster :) The reason depends on our
> pattern database: There are many patterns like this:
>
> ..OO             reverse sente sagari
> .OYX
> .*..
> ....
> ----
>
> that only match somewhere at the edge, and the diagonal spiral tends
> to find out faster whether the anchor ('Y') has the right distance to
> the edge.

Why not test the distance of Y to the edge before even starting to check
whether all the points in the spiral match?

Anders Kierulf
www.smartgo.com


_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/