On Mon, Jun 14, 2010 at 5:02 AM, <[email protected]> wrote: > I'm doing research into board evaluation using pattern recognition, with the > key being an > algorithm that can find patterns on a board without the time required being > proportional > to the number of patterns being searched for.
There have been plenty of ideas posted about pattern-matchers that do not require O(n). AFAIK, decision-tree based pattern matching is pretty standard nowadays, requiring O(log2(n)). A little while back I described a method on this list to do pattern-matching with minimal computation. But I'm not sure how the method you're describing is any different from what old programs like Goliath used to do. Mark _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
