On 25, Aug 2005, at 8:00 AM, Aloril wrote:
DrunkenGnu is meta machine: Get list of top moves from GNU Go 3.6 and then select one move randomly from all legal moves favoring most move that is at top of GNU Go 3.6 top moves. Also if selected move was not among top moves, do additional sanity check for negative score check and if too bad move, try again with other move.
How does your algorithm "favor" the top moves? Have you considered something like a Boltzman rather than a Drunk weighting? Cheers, David _______________________________________________ gnugo-devel mailing list [email protected] http://lists.gnu.org/mailman/listinfo/gnugo-devel
