On Wed, Apr 8, 2009 at 01:13, Darren Cook <[email protected]> wrote: >>> Linked lists have a terrible cache behaviour: every pointer (or index) >>> dereference has a nearly 100% chance of causing a cache miss. >>>... >> >> It's quite easy and efficient to put all lists (cyclic, linked in one >> direction) of liberties (on one 19x19 board) >> into 4*19*19*sizeof (vertex) array. If vertex is int32 then it is about 1.5 >> kB. > > Hi Lukasz, (private reply, but reply to the list is fine by me) > Do you have some code demonstrating the above idea? It sounds > interesting, but I cannot grasp what the data and algorithm look like.
4*19*19*4 is around 5.5 kB On 9x9 it will be less than 1.5 kB My mistake. Are you still interested? > > Darren > > > -- > Darren Cook, Software Researcher/Developer > http://dcook.org/mlsn/ (English-Japanese-German-Chinese-Arabic > open source dictionary/semantic network) > http://dcook.org/work/ (About me and my work) > http://dcook.org/blogs.html (My blogs and articles) > _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
