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

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



> -----Original Message-----
> From: Paul Pogonyshev [mailto:pogonyshev@xxxxxxxxxxxxxxxxx]
> Sent: Friday, January 21, 2005 0:39
> To: tesujisoftware@xxxxxxxxxxxxxxxxx; computer-go
> Subject: Re: [computer-go] Spiral pattern matching and data structures
>
>
> In GNU Go patterns can use wildcards, for instance "o" stands for "stone
> of player who is to play or no stones."  Effectively, a pattern
> with several
> wildcards can easily stand for 20--100 "plain" patterns.
>

I also allow wild-cards, but I don't expand them in the DFA. I suppose that
explains why I don't see the explosion in memory usage.

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