Daniel Bump wrote:
One thing that I think needs to get done is to implement persistent
caching of semeai results so we can increase the semeai node
limits. If you look in the function owl_attack() in owl.c you will
see a call to search_persistent_owl_cache(). There is no
corresponding call from the function owl_analyze_semeai().
Other people might have other projects to suggest.
A project of similar scope would be to reorganize the persistent
reading
cache from a simple array to a heap sorted by lowest score. Then
store_persistent_reading_cache() would not have to go through the whole
array when trying to find the entry with lowest score (it does so when
the cache is full).
This would give an immediate speedup of about 1% and, more importantly,
allow us to increase the size of this cache with little performance
cost
in the caching itself.
It would also be a good idea if you subscribe to the gnugo-devel
mailing
list (see the link from the gnugo development home page).
Arend
_______________________________________________
gnugo-devel mailing list
address@hidden
http://mail.gnu.org/mailman/listinfo/gnugo-devel