Hello, > 3) What sort of algorithm is used to match patterns once you have mined them > from some data source?
There are relatively few possible 3x3 patterns, so it is easy to make a look up table with an entry for every possible pattern. For larger patterns, it's more complicated. Mined patterns typically don't include don't cares. In that case, a?hash table works well. For patterns with don't cares, people have done this a lot of different ways. I don't think there is a consensus on the best way. - Dave Hillis
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
