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

[Paul Pogonyshev <pogonyshev@xxxxxxx>]

Anders Kierulf wrote:
> > > Why not test the distance of Y to the edge before even starting to
> > > check whether all the points in the spiral match?
> >
> > Because with DFA you match all patterns at once.  You cannot filter
> > out patterns in advance, you just get a list of matching patterns.
>
> 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?

Your idea might still work out, though.  Just I'm not the one who is
going to try, as it seems quite hairy and not easy to implement.
(Even though I did such hairy and not easy to implement things before
alredy.)

Paul

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