That's what I re-invented recently, and I combined it with a joseki book made from strong player games as well. Both books just recommend a bunch of moves, the appropriate choice is left to the search algorithm. Because I don't return a move instantly without search, I call it "active book application".
So far (without any kind of parameter tuning or manual changes to the book) it increased Orego's win rate against GNUGo by 4-5 percent, with 10 seconds per move. I wonder if the effect would be stronger or weaker for a stronger program - it's more difficult to improve a stronger program of course, but it might also understand some of the openings better and make better use of them.
A clean, hand-coded book of joseki might be very strong in this framework, but I don't have the time.
Thanks everybody for your answers. I might post a short paper about this soon if people are interested.
_______________________________________________
Computer-go mailing list
Compu...@dvandva.org
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
I am interested and looking forward to read your paper about the
"opening+joseki book".
Aja
----- Original Message -----
From: "Hendrik Baier" <hendri...@googlemail.com>
To: <compu...@dvandva.org>
Sent: Tuesday, July 12, 2011 5:47 AM
Subject: Re: [Computer-go] Computer-go Digest, Vol 18, Issue 29