[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [gnugo-devel] DFA rewrite
From: |
Tanguy URVOY |
Subject: |
Re: [gnugo-devel] DFA rewrite |
Date: |
Mon, 02 Sep 2002 11:09:39 +0200 |
Hi,
Inge Wallin wrote:
> This is a good idea, but there is a little problem.
>
> If you do a profile of the running engine, you can clearly see that
> pattern matching itself takes less than 10% of the run time and
> reading takes almost 90%. All this reading comes from constraints in
> the pattern, i.e. once a pattern has matched some reading is done to
> see if it really applies.
Global DFA scaning with match sets allows us to precompute
a lot of constrains like goal testing before reading.
What Did you profile the time spent in goal testing ?
This is true that we can only save 9% of the time in the actual engine,
but a fast and robust pattern matcher is a key to build robust
reading algorithms.
This is worth it and the memory usage can be controlled.
When i worked on the first version of the DFA matcher
there was the same little problem. But owl was not
yet implemented in gnugo...
This should be tried.
--
-------------------------------------
Tanguy Urvoy http://www.turvoy.fr.st
-------------------------------------
Re: [gnugo-devel] DFA rewrite, Tanguy URVOY, 2002/09/02