On Wed, Mar 25, 2015 at 07:14:39PM +0100, Kahn Jonas wrote:
> >>Based on my
> >>observations, the limiting factor is time - Python is sloooow and
> >>a faster language with the exact same algorithm should be able to speed
> >>this up at least 5x, which should mean at least two ranks level-up.
> >
> >Maybe a first step would be using numpy arrays for the board and
> >patterns. They are quite fast, so the pattern matching should go fast.
> >It won't be any help for the really sequential loops, however.
>
> On further thought, I think the pattern matching for strings is already
> fast, so maybe nothing to gain. There is no real operation ON the arrays
> in the programm…
To speed up the Python program, first thing would be to add a list of
chains with list of liberties - right now, chains get floodfilled and
regexed again and again and it's a huge time sink. Maybe that could
speed things up by 25-100%, but I just didn't feel like doing that
myself anymore. :-)
--
Petr Baudis
If you do not work on an important problem, it's unlikely
you'll do important work. -- R. Hamming
http://www.cs.virginia.edu/~robins/YouAndYourResearch.html
_______________________________________________
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go
