Re: [gnugo-devel] DFA should be "best" NFA

[Heikki Levanto]

On Mon, Jan 27, 2003 at 03:58:24PM +0100, Tanguy URVOY wrote:
> (maybe the fastest Go pattern matcher of the West ?)

One simple observation: On each move we match each pattern against each
point on the board (well, almost). This is wasteful. If we could keep
persisitent state on the patterns, we could possibly save a lot.

Most common moves only add stones to the board. If we could keep (at each
point) a list of patterns that can match with only adding stones, these lists
could quickly come short and fast to match. Some sort of optimized decision
tree? Need to rebuild them if stones are removed, of course. And probably
this all would take far too much memory to be possible... How many patterns
do we actually have these days? (don't have the sources on this machine,
can't get to count myself)

-- 
Heikki Levanto  LSD - Levanto Software Development   <address@hidden>