I've been tinkering with www.ohloh.net, which is probably best described as a web 2.0 freshmeat. Rather than tracking manually-updated releases it relies on automatically detected updates to version control repositories, RSS and geo-urls. It relies on wiki like editing rather than the strict ownership rules of freshmeat. ohloh does automatic language detection and source code analysis based on the version control repository and attributes individual commits to specific developers and their ohloh user account.
I've added and am actively curating a group of go/baduk projects. The overall goal is to encourage reuse and reduce the willingness of hackers to rewrite go/baduk systems from scratch.
My next step on the technical side is to write some GRDDL (Gleaning Resource Descriptions from Dialects of Languages) to transform the XML returned by the API into RDF, which I can them import into simal.
My next step on the social side is to mention what I'm doing in some of the go/baduk mailing lists, but I want to wait until I've got something concrete to provide that Sensei's Library (the current repository of information about go/baduk programs) hasn't already got.
Tampilkan postingan dengan label go. Tampilkan semua postingan
Tampilkan postingan dengan label go. Tampilkan semua postingan
Sabtu, 03 Mei 2008
Selasa, 18 Maret 2008
Tinkering with suffix-trees and algorithms
I've been tinkering with learning algorithms for my computer-go player, jgogears.
It linearises board positions and then uses classic string processing techniques, principally a large suffix-tree. Suffix-trees are widely used in information processing, information theory and compression fields of computer science. I also used them extensively in my recent Ph.D.
Currently I'm training with about 200 go games (~40k moves), giving me about 950K nodes in my suffix tree.
I've just switched my linearisation method from a strict distance measure to one which capitalises on adjacency much better.
There are a number of tuning parameters for the rate at which I grow the tree. I'll be tinkering with them as I increase the number of boards I'm using for training.
It linearises board positions and then uses classic string processing techniques, principally a large suffix-tree. Suffix-trees are widely used in information processing, information theory and compression fields of computer science. I also used them extensively in my recent Ph.D.
Currently I'm training with about 200 go games (~40k moves), giving me about 950K nodes in my suffix tree.
I've just switched my linearisation method from a strict distance measure to one which capitalises on adjacency much better.
There are a number of tuning parameters for the rate at which I grow the tree. I'll be tinkering with them as I increase the number of boards I'm using for training.
Langganan:
Postingan (Atom)