Generation of AI Agent in Imperfect Information Card Games Using MCTS Algorithm: Focused on Hearthstone |
Oh, Pyeong
(Graduate School, Dept. of Interaction Design, Hallym University)
Kim, Ji-Min (Graduate School, Dept. of Interaction Design, Hallym University) Kim, Sun-Jeong (Graduate School, Dept. of Interaction Design, Hallym University) Hong, Seokmin (Dept. of Advertising and Public Relations, Hallym University) |
1 | G. Chaslot, S. Bakkes, I. Szita, & P. Spronck, "Monte-Carlo Tree Search: A New Framework for Game AI", In AIIDE, 2008. |
2 | M. Enzenberger, M. Muller, B. Arneson, and R. B. Segal, "Fuego - An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search", IEEE Trans. Comp. Intell. AI Games, Vol. 2, No. 4, pp. 259-270, 2010. DOI |
3 | H. J. van den Herik, "The Drosophila Revisited", Int. Comp. Games Assoc. J, Vol. 33, No. 2, pp. 65-66., 2010. |
4 | C. S. Lee, M. H. Wang, G. M. J.-B. Chaslot, J. B. Hoock, A. Rimmel, O. Teytaud, S.-R. Tsai, S.-C. Hsu, and T.-P. Hong, "The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments", IEEE Trans. Comp. Intell. AI Games, vol. 1, no. 1, pp. 73-89, 2009. DOI |
5 | A. Rimmel, O. Teytaud, C. S. Lee, S. J. Yen, M. H. Wang, and S.-R. Tsai, "Current Frontiers in Computer Go", IEEE Trans. Comp. Intell. AI Games, Vol. 2, No. 4, pp. 229-238, 2010. DOI |
6 | C. S. Lee, M. Muller, and O. Teytaud, "Guest Editorial: Special Issue on Monte Carlo Techniques and Computer Go", IEEE Trans. Comp. Intell. AI Games, Vol. 2, No. 4, pp. 225-228, 2010. DOI |
7 | G. Chaslot, "Monte-carlo tree search.", Maastricht: Universiteit Maastricht, 2010. |
8 | M. Buro, J. R. Long, T. Furtak, and N. R. Sturtevant, "Improving State Evaluation, Inference, and Search in Trick-Based Card Games", in Proc. 21st Int. Joint Conf. Artif. Intell., Pasadena, California, pp. 1407-1413, 2009. |
9 | P. I. Cowling, C. D. Ward, E. J. Powley, "Ensemble Determinization in Monte Carlo Tree Search for the Imperfect Information Card Game Magic: The Gathering", IEEE Trans. Comp. Intell. AI Games, Vol. 4, No. 4, pp. 241-257, 2012. DOI |
10 | https://en.wikibooks.org/wiki/A-level_Computing/AQA/Paper_1/Theory_of_computation/Finite_state_machines |
11 | http://aigamedev.com/open/article/hfsm-gist/ |
12 | J. Vermorel, & M. Mohri, "Multi-armed bandit algorithms and empirical evaluation", In Machine learning: ECML 2005, Springer Berlin Heidelberg, pp. 437-448. 2005. |
13 | Young-Wook. Choi, Byung-Doo. Lee, "The best move sequence in playing Tic-Tac-Toe game", Korean Society For Computer Game, Vol. 27, No. 3, pp. 11-16. 2014. |
14 | A. Garivier, & E. Moulines, " ", arXiv preprint arXiv:0805.3415. 2008. |
15 | Kyung-Min. Seo, and Hae-Sang. Song, "Importance Sampling Embedded Experimental Frame Design for Efficient Monte Carlo Simulation", The Journal of the Korea Contents Association, Vol. 13, No. 4, pp.53-63, 2013. DOI |
16 | C. B. Browne, E. Powley, D. Whitehouse, S. M. Lucas, P. I. Cowling, P.Rohlfshagen, ... & S. Colton, "A survey of monte carlo tree search methods", Computational Intelligence and AI in Games, IEEE Transactions on, Vol. 4, No. 1, pp. 1-43, 2012. DOI |
17 | http://www.inven.co.kr/board/powerbbs.php?come_idx=3559&name=subject&keyword=%EA%B0%80%EC%B9%98&l=1807 |
18 | https://en.wikipedia.org/wiki/Monte_Carlo_tree_search |