Re: [computer-go] Pattern Matcher

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

> How can things be dependant upon the bandwidth to RAM?

Sorry I mean the time to load a cache line from RAM into the cache.


> a) My processors here have a L2 cache so majority of lookups will
>    come from that.

The pattern lookup database is 65 MB.

> confuse strategics with positional play. No big deal. Strategics is when
> you play with a plan. Your thing at most can suggest which move to try
first.

I was thinking about strategic bombing versus tactical bombing :)
Both are done with a plan but strategic bombing is "heavy" bombing of whole
cities or industrial complexes.

I consider a full, slow pattern search "strategic" because it is heavy-duty,
massive and slow and the effects are only noticeable later on and are not
easy to quantify, just like sacking a city.


> In theory it is possible to let your automatic recognized patterns auto
> generate to C code.

Sure.
Then that code would be around 100 times larger than the pattern database.
6.5 GB or thereabouts.

My patterns are huge. A million are the size of the entire board.
A million are the size of a third of the board.
A million are the size of a quarter of the board.

> Such automatic generated C code which automatically generates itself into
a
> very optimal decision tree can run very fast.

Extremely much slower than my system.


> A big L2 cache would certainly help in such case to keep everything within
L2.

Yep.
A L2 cache the size of Texas (64 MB will get you somewhere).

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