Monte-Carlo Tree Search for the game of Scotland Yard

2011 IEEE Conference on Computational Intelligence and Games, CIG 2011

Volumn , Issue , 2011, Pages 158-165

  Nijssen, J A M ^a   Winands, Mark H M ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN KNOWLEDGE; GRAPH-BASED; MONTE CARLO; NINTENDO DS; ROBUST TECHNIQUE; SCOTLAND; TREE SEARCH; TWO-PLAYER GAMES;

ARTIFICIAL INTELLIGENCE; PLANT EXTRACTS;

SOFTWARE TESTING;

EID: 80054044793     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2011.6032002     Document Type: Conference Paper

References (32)

1. R. Coulom, "Efficient Selectivity and Backup Operators in Monte- Carlo Tree Search, " in Computers and Games (CG 2006) (H. J. van den Herik, P. Ciancarini, and H. H. L. M. Donkers, eds.), vol. 4630 of LNCS, (Berlin, Germany), pp. 72-83, Springer-Verlag, 2007.
2. L. Kocsis and C. Szepesvári, "Bandit Based Monte-Carlo Planning, " in Machine Learning: ECML 2006 (J. Fürnkranz, T. Scheffer, and M. Spiliopoulou, eds.), vol. 4212 of LNCS, (Berlin, Germany), pp. 282-293, Springer-Verlag, 2006. (Pubitemid 44618839)
3. D. E. Knuth and R. W. Moore, "An analysis of alpha-beta pruning, " Artificial Intelligence, vol. 6, no. 4, pp. 293-326, 1975.
4. C. Luckhart and K. Irani, "An algorithmic solution of n-person games, " in Proceedings of the 5th National Conference on Artificial Intelligence (AAAI), vol. 1, pp. 158-162, 1986.
5. S. Gelly and Y. Wang, "Exploration Exploitation in Go: UCT for Monte-Carlo Go, " in Neural Information Processing Systems Conference On-line trading of Exploration and Exploitation Workshop, 2006.
6. S. Gelly and D. Silver, "Combining Online and Offline Knowledge in UCT, " in ICML '07: Proceedings of the 24th International Conference on Machine Learning, (New York, NY, USA), pp. 273-280, ACM, 2007.
7. M. H. M. Winands, Y. Björnsson, and J.-T. Saito, "Monte Carlo Tree Search in Lines of Action, " IEEE Transactions on Computational Intelligence and AI in Games, vol. 2, no. 4, pp. 239-250, 2010.
8. B. Arneson, R. B. Hayward, and P. Henderson, "Monte-Carlo Tree Search in Hex, " IEEE Transactions on Computational Intelligence and AI in Games, vol. 2, no. 4, pp. 251-258, 2010.
9. R. J. Lorentz, "Amazons Discover Monte-Carlo, " in Computers and Games (CG 2008) (H. J. van den Herik, X. Xu, Z. Ma, and M. H. M. Winands, eds.), vol. 5131 of LNCS, (Berlin, Germany), pp. 13-24, Springer-Verlag, 2008.
10. N. R. Sturtevant, "An Analysis of UCT in Multi-player Games, " ICGA Journal, vol. 31, no. 4, pp. 195-208, 2008.
11. M. P. D. Schadd, M. H. M. Winands, H. J. van den Herik, G. M. J.-B. Chaslot, and J. W. H. M. Uiterwijk, "Single-Player Monte-Carlo Tree Search, " in Computers and Games (CG 2008) (H. J. van den Herik, X. Xu, Z. Ma, and M. H. M. Winands, eds.), vol. 5131 of LNCS, (Berlin, Germany), pp. 1-12, Springer-Verlag, 2008.
12. Y. Björnsson and H. Finnsson, "CADIAPLAYER: A Simulation-Based General Game Player, " IEEE Transactions on Computational Intelligence and AI in Games, vol. 1, no. 1, pp. 4-15, 2009.
13. M. L. Ginsberg, "GIB: Steps Toward an Expert-Level Bridge-Playing Program, " in In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 584-589, 1999.
14. D. Billings, L. Pena, J. Schaeffer, and D. Szafron, "Using Probabilistic Knowledge and Simulation to Play Poker, " in AAAI, pp. 697-703, AAAI press, 1999.
15. B. Sheppard, Towards Perfect Play of Scrabble. PhD thesis, Universiteit Maastricht, The Netherlands, 2002.
16. R. Bjarnason, A. Fern, and P. Tadepalli, "Lower Bounding Klondike Solitaire with Monte-Carlo Planning, " in International Conference on Automated Planning and Scheduling/Artificial Intelligence Planning Systems, 2009.
17. P. Ciancarini and G. P. Favini, "Monte Carlo Tree Search Techniques in the Game of Kriegspiel, " in Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09) (C. Boutilier, ed.), (San Francisco, CA, USA), pp. 474-479, Morgan Kaufmann Publishers Inc., 2009.
18. G. Van den Broeck, K. Driessens, and J. Ramon, "Monte-Carlo Tree Search in Poker using Expected Reward Distributions, " in Advances in Machine Learning (Z.-H. Zhou and T. Washio, eds.), vol. 5828 of LNAI, (Berlin, Germany), pp. 72-83, Springer-Verlag, 2009.
19. M. J. V. Ponsen, Strategic Decision-making in Complex Games. PhD thesis, Maastricht University, The Netherlands, 2011.
20. "Scotland Yard - Board Game - BoardGameGeek." http://www.boardgamegeek.com/boardgame/438/scotland-yard, retrieved April 2011.
21. A. Frackowski, "[NDS Review] Scotland Yard DS - Hold.Start.Select, " 2011. http://holdstartselect.com/nds-review-scotland-yard-ds/.
22. E.-E. Doberkat, W. Hasselbring, and C. Pahl, "Investigating Strategies for Cooperative Planning of Independent Agents through Prototype Evaluation, " in Coordination Models and Languages (COORDINATION '96) (P. Ciancarini and C. Hankin, eds.), vol. 1061 of LNCS, (Berlin, Germany), pp. 416-419, Springer-Verlag, 1996. (Pubitemid 126063075)
23. M. Sevenster, "The Complexity of Scotland Yard, " in Interactive Logic (J. van Benthem, B. Löwe, and D. Gabbay, eds.), pp. 209-246, Amsterdam University Press, 2008.
24. G. M. J.-B. Chaslot, M. H. M. Winands, J. W. H. M. Uiterwijk, H. J. van den Herik, and B. Bouzy, "Progressive Strategies for Monte-Carlo Tree Search, " New Mathematics and Natural Computation, vol. 4, no. 3, pp. 343-357, 2008.
25. B. Bouzy, "Associating Domain-Dependent Knowledge and Monte Carlo Approaches within a Go Program, " Information Sciences, vol. 175, no. 4, pp. 247-257, 2005. (Pubitemid 41312975)
26. S. Gelly, Y. Wang, R. Munos, and O. Teytaud, "Modifications of UCT with Patterns in Monte-Carlo Go, " tech. rep., INRIA, 2006.
27. Y. Tsuruoka, D. Yokoyama, and T. Chikayama, "Game-Tree Search Algorithm Based on Realization Probability, " ICGA Journal, vol. 25, no. 3, pp. 132-144, 2002.
28. M. H. M. Winands and Y. Björnsson, "Enhanced Realization Probability Search, " New Mathematics and Natural Computation, vol. 4, no. 3, pp. 329-342, 2008.
29. Y. Higashiuchi and R. Grimbergen, "Enhancing Search Efficiency by Using Move Categorization Based on Game Progress in Amazons, " in Advances in Computer Games (ACG 2005) (H. J. van den Herik, S.-C. Hsu, T.-S. Hsu, and H. H. L. M. Donkers, eds.), vol. 4250 of LNCS, (Berlin, Germany), pp. 73-87, Springer-Verlag, 2006.
30. M. Buro, "Experiments with Multi-ProbCut and a New High-Quality Evaluation Function for Othello, " in Games in AI Research (H. J. van den Herik and H. Iida, eds.), pp. 77-96, 2000.
31. R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA, USA, 1998.
32. D. Silver and J. Veness, "Monte-Carlo Planning in Large POMDPs, " in Advances in Neural Information Processing Systems 23 (J. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta, eds.), pp. 2164-2172, Curran Associates, Inc., 2010.