[computer-go] Don't cares in Pattern Matching

[Jason House]

Once upon a time, I started a page on senseis to try and give a mini 
encyclopedia of computer go algorithm options. The page is located at 
http://senseis.xmp.net/?computergoalgorithms

I haven't added to it in a while, but I'm also very early in my own bot 
development.  I haven't implemented any (well known) algorithms in my 
bot that aren't on that page.

It would be nice to see that page grow based on the 
knowledge/experience/research of people on this mailing list.

Chris Fant wrote:
> On 6/14/06, Eric Boesch <ericboesch at hotmail.com> wrote:
>> Pattern matching can require a time/space tradeoff. If the patterns 
>> are very
>> irregular and full of holes, then an attempt to minimize time usage by
>> treating each don't-care case that is tested as three or four different
>> patterns could lead inevitably to space usage that grows 
>> expontentially with
>> the number of patterns, as Chrilly alluded to.
> 
> Actually it grows linearly with the number of patterns and
> exponentially with the average number of don't-cares per pattern.