Re: [computer-go] Pattern Matcher

["Frank de Groot" <frank@xxxxxxxxxxxxx>]

> "At what speed can you predict for unknown position X the moves"

It takes, on average, half a millisecond for a position.
That includes the delta-administration of 2888 patterns and looking them up.

It gets much faster when I exclude the largest patterns.
The largest patterns are the size of the board (pat7) and 3/3 of the board
(pat6).

You can imagine the speedup when I start to exclude them after about 40
moves.
IIRC things become around 50 times faster.
Things speed up again when I start to exclude the medium-size patterns at
around move 150.

Then, the time needed to pattern-evaluate a position is heavily dependent on
the bandwidth to RAM.

When I use only pat0 and pat1 (the smallest patterns), evaluation speed for
a position is about 100 x the time needed to load a cache line.

But I think the system should mainly be used for the strategic part of the
opening, much less in search.

_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/