(2011/05/25 22:44), Stefan Kaitschick wrote:
As to the problem of smarter playouts, has something along the lines of the "killer heuristic"(the most successful response sofar to a specific move) , used in chess programming, been tried? There's a lot more housekeeping than with RAVE and AMAF, but I can't believe it hasn't been tried. Maybe the effort could be reduced by only storing the response-successrates of the 5*5 surrounding area, or something like that. Anyways, I haven't even heard of a failed attempt, which is a little strange to me.
I suppose that is called "Adaptive Playout". Hendrik Baier reported LGRF heuristics and other lots of failed methods. www.ke.tu-darmstadt.de/lehre/arbeiten/master/2010/Baier_Hendrik.pdf -- Yamato _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
