I think the move prediction methods are also relevant e.g. see Wistuba et al, CIG 2012:
http://geneura.ugr.es/cig2012/papers/paper82.pdf Simon Lucas -----Original Message----- From: [email protected] [mailto:[email protected]] On Behalf Of Cameron Browne Sent: 20 January 2014 13:14 To: [email protected] Subject: [Computer-go] RAVE-Tiling? Hi Stefan, > Date: Mon, 20 Jan 2014 12:07:11 +0100 > From: Stefan Kaitschick <[email protected]> > To: [email protected] > Subject: [Computer-go] RAVE-Tiling? > > Has anybody ever experimented with tiling the board with a set of possibly > overlaping smaller tiles, and updating the RAVE statistic for those tiles, > whenever the same pattern comes up for that tile in the tree? This would > probably be more reliable than AMAF, and fill faster than RAVE, so it might > be a useful addition. There could even be multiple sets of different sizes. > I'm proposing fixed borders for the tiles. Another approach might be to > introduce dynamic tiles in areas that have been found by some measure to be > critical. The papers on Contextual Monte Carlo might be relevant: A. Rimmel and F. Teytaud, "Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search," in Proc. Applicat. Evol. Comput. 1, LNCS 6624, Torino. Italy, 2010, pp. 201-210. J.-B. Hoock, C.-S. Lee, A. Rimmel, F. Teytaud, O. Teytaud, and M.-H. Wang, "Intelligent Agents for the Game of Go," IEEE Comput. Intell. Mag., vol. 5, no. 4, pp. 28-42, 2010. Regards, Cameron _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
