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

["Anders Kierulf" <anders@xxxxxxxxxxx>]

> > You can filter patterns in advance by creating a separate DFA for
> > each distance of the anchor point to the edge.
> 
> What about patterns like this:
> 
> |....
> |.Y..
> |....
> |....
> +----
> 
> where the anchor has different distance to different edges?

Good point. To categorize the patterns into different DFAs, you can easily
identify the distance to the closest edge. But when matching, you probably
want to match a 3-4 point against both the line-3 and the line-4 DFAs.

Question: When checking the spiral of points around an anchor, you probably
repeat that for all symmetries? Or do you include the symmetric patterns in
the DFA? Either way, if you're just testing patterns along an edge, you
could avoid some of those symmetries?

Anders Kierulf
www.smartgo.com


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