Towards MCTS for creative domains

Proceedings of the 2nd International Conference on Computational Creativity, ICCC 2011

Volumn , Issue , 2011, Pages 96-101

  Browne, Cameron ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GO; EVOLUTIONARY APPROACH; MARKOVIAN; MONTE CARLO; OPTIMAL ACTIONS; OPTIMAL SEQUENCE; SUBTREES; TREE SEARCH;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION;

OPTIMIZATION;

EID: 84858962186     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Andres, N. 2009. Yavalath. http://www.nestorgames.com.
2. Auer, P.; Cesa-Bianchi, N. and Fischer, P. 2002. Finite time analysis of the multiarmed bandit problem. Machine Learning 47(2-3):235-256.
3. Bender, M. and Farach-Colton, M. 2000. The LCA Problem Revisited. In Latin 2000: Theoretical Informatics, LNCS 1776, 88-94. Springer:Berlin.
4. Bjornnsson, Y. and Finnsson, H. 2009. CadiaPlayer: A Simulation-Based General Game Player. IEEE Computational Intelligence and AI in Games 1(1):14-15.
5. Browne, C. 2008. Automatic Generation and Evaluation of Recombination Games. Ph.D. Thesis, Faculty of Information Technology, Queensland University of Technology.
6. Chaslot, G.; Bakkes, S.; Szita, I. and Spronck, P. 2008. Monte-Carlo Tree Search: A New Framework for Game AI. In Proceedings of AIIDEC-08, 216-217.
7. Childs, B.; Brodeur, J. and Kocsis, L. 2008. Transpositions and Move Groups in Monte Carlo Tree Search. In Proceedings of CIG'08, 389-395.
8. Coloum, R. 2006. Efficient Backup and Selectivity Operators in Monte-Carlo Tree Search. In Computers and Games 2006. 72-83.
9. Gelly, S.; Wang, Y.; Munos, R. and Teytaud, O. 2006. Modification of UCT with Patterns in Monte-Carlo Go. Technical Report 6062, INRIA, Orsay Cedex:France.
10. Johnson-Laird, P. 2002. How Jazz Musicians Improvise. Music Perception 19(3):415-442.
11. Keullers, E. and Brysbaert, M. 2010. Wuggy: A multilingual pseudoword generator. Behavior Research Methods 42(3):627-633.
12. Kocsis, L. and Szepesvari, C. 2006. Bandit based Monte-Carlo Planning. In Machine Learning: ECML 2006, LNCS 4212, Berlin:Springer. 282-293.
13. Koza, J.; Bennett, F.; Andre, D.; and Keane, M. 2001. Genetic Programming. In AISB'99 Symposium on AI and Scientific Creativity, 29-38.
14. Pachet, F. 2004. Beyond the Cybernetic Jam Fantasy: The Continuator. IEEE Computer Graphics and Applications 4(1):31-35.
15. Prüfer, H. 1918. Neuer Beweis eines Satzes uber Permutations". Arch. Math. Physics. 27:742-744.
16. Rimmel, A. and Teytaud, F. 2010. Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search. Applications of Evolutionary Computing 8623:201-210.
17. Romero, J. and Machado, P. 2008. The Art of Artificial Evolution: A Handbook on Evolutionary Art and Music. Berlin:Springer.
18. Schmidt, G. Omega PC Axiom version: The making of. http://boardgamegeek. com/thread/563815/.
19. Sturtevant, N. 2002. A Comparison of Algorithms for Multi-Player Games. In Computers and Games 2002. 108-122.