2012

Baier, H. and Winands, M.H.M. (2012). Beam Monte-Carlo Tree Search. In 2012 IEEE Conference on Computational Intelligence and Games (CIG 2012), pp. 227-233. IEEE

Baier, H. and Winands, M.H.M. (2012). Nested Monte-Carlo Tree Search for Online Planning in Large MDPs. In 20th European Conference on Artificial Intelligence (ECAI 2012) (eds. L. De Raedt, C. Bessière, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, and P. J. F. Lucas), pp. 109-114. IOS press.

Baier, H. and Winands, M.H.M. (2012). Time Management for Monte-Carlo Tree Search in Go. In Advances in Computer Games (ACG 13), Vol. 7168 of Lecture Notes in Computer Science, pp. 39-51. Springer Verlag, Heidelberg/Berlin.

L. J. J. van Iersel, S. M. Kelk, N. Lekic and C. Scornavacca (2012). A practical approximation algorithm for solving massive instances of hybridization number. In Workshop on Algorithms in Bioinformatics (WABI), volume 7534 of Lecture Notes in Computer Science (LNCS), pages 430-440.

S. M. Kelk, L. J. J. van Iersel, N. Lekic, S. Linz, C. Scornavacca and L. Stougie (2012): Cycle killer…qu’est-ce que c’est? on the comparative approximability of hybridization number and directed feedback vertex set. SIAM Journal on Discrete Mathematics, 26(4): 1635–1656.

S. M. Kelk, C. Scornavacca and L. J. J. van Iersel (2012): On the elusiveness of clusters. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9(2):517-534.

S. M. Kelk and C. Scornavacca (2012): Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable. Algorithmica, DOI=10.1007/s00453-012-9708-5.

S. M. Kelk, B. Olivier, L. Stougie and F. Bruggeman (2012): Optimal flux spaces of genome-scale stoichiometric models are determined by a few subnetworks. Nature Scientific Reports, 2(580), DOI: 10.1038/srep00580.

Kishimoto, A., Winands, M.H.M., Müller, M., and Saito, J-T. (2012). Game-Tree Search Using Proof Numbers: The First Twenty Years. ICGA Journal, Vol. 35, No. 3, pp. 131-156.

D.R. Koepsell, K. Staňková (2012): Non-proliferation regimes: immoral and risky – A game-theoretic approach. International Journal on World Peace, 29(2), 61-81.

Nijssen, J.A.M. and Winands, M.H.M. (2012). Monte-Carlo Tree Search for the Hide-and-Seek Game Scotland Yard. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 4, No. 4, pp. 282 – 294.

Nijssen, J.A.M. and Winands, M.H.M  (2012). Playout Search for Monte-Carlo Tree Search in Multi-Player Games. In Advances in Computer Games (ACG 13), vol. 7168 of Lecture Notes in Computer Science, pp. 72-83. Springer Verlag, Heidelberg/Berlin.

Nijssen, J.A.M. and Winands, M.H.M. (2012). An Overview of Search Techniques in Multi-Player Games. Computer Games Workshop at ECAI 2012, pp. 50-61. Montpellier, France.

Pepels, T. and Winands, M.H.M. (2012). Enhancements for Monte-Carlo Tree Search in Ms Pac-Man. In 2012 IEEE Conference on Computational Intelligence and Games (CIG 2012), pp. 265-272. IEEE.

T. Piovesan and S. M. Kelk (2012): A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees. IEEE/ACM Transactions on Computational Biology and Bioinformatics, http://doi.ieeecomputersociety.org/10.1109/TCBB.2012.134.

Schadd, M.P.D., Winands, M.H.M., Tak, M.J.W., and Uiterwijk, J.W.H.M. (2012). Single-Player Monte-Carlo Tree Search for SameGame. Knowledge-Based Systems. Vol. 34, pp. 3–11.

K. Staňková (2012): Dynamic Games in the European Electricity Market, Industrial Engineeering: Innovative Networks (S.P. Sethi, M. Bogotaj, L. Ros-McDonnel, eds.), chapter 22, 191-200, Springer.

K. Staňková, A. Abate, M.W. Sabelis (2012): Irreversible prey diapause as an optimal strategy of a physiologically extended Lotka-Volterra model. Journal of Mathematical Biology, 66(4-5), 767-794 (published online October).

Stankiewicz, J.A., Winands, M.H.M. and Uiterwijk, J.W.H.M. (2012). Monte-Carlo Tree Search Enhancements for Havannah. In Advances in Computer Games (ACG 13), Vol. 7168 of Lecture Notes in Computer Science, pp. 60-71. Springer Verlag, Heidelberg/Berlin.
Tak, M.J.W., Winands, M.H.M., and Björnsson, Y. (2012). N-Grams and the Last-Good-Reply Policy applied in General Game Playing. IEEE Transactions on Computational Intelligence and AI in Games. Vol. 4, No. 2, pp. 73-83.

Den Teuling, N.G.P. and Winands, M.H.M. (2012). Monte-Carlo Tree Search for the Simultaneous Move Game Tron. Computer Games Workshop at ECAI 2012, pp. 126-141. Montpellier, France.

Uiterwijk, J.W.H.M, Roos, N., and Winands, M.H.M. (eds.) (2012), Proceedings of the Twenty-Fourth Benelux Conference on Artificial Intelligence (BNAIC 2012). Maastricht University, Maastricht, The Netherlands, ISSN 1568-7805.

P. Uyttendaele, F. Thuijsman, P. Collins, R. Peeters, G. Schoenmakers, R. Westra (2012): Evolutionary games and periodic fitness. Dynamic Games and Applications 2, 335-345 (DOI: 10.1007/s13235-012-0048-5).

2011

Baier, H. and Winands, M.H.M. (2011). Active Opening Book Application for Monte-Carlo Tree Search in 19×19 Go. In Proceedings of the Twenty-Third Benelux Conference on Artificial Intelligence (BNAIC 2011) (eds. P. De Causmaecker, J. Maervoet, T. Messelis, K. Verbeeck and T. Vermeulen), pp. 3-10.

Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, Jean-Baptiste Hoock, Thomas Hérault, Arpad Rimmel, Fabien Teytaud, Olivier Teytaud, Paul Vayssière, Ziqin Yut. (2011) Scalability and Parallelization of Monte-Carlo Tree Search. In Computers and Games (CG 2010), Lecture Notes in Computer Science (LNCS 6515),  pp. 48-58.

J. Derks, M. Tennekes (2011): Payoff functions in the one-way flow model of network formation for which Nash networks exist. International Game Theory Review 13 (1), 61-73.

J. Flesch, G. Schoenmakers, K. Vrieze (2011): Loss of Skills in Coordination Games. International Journal of Game Theory 40 (4), 769-789.

Daniel Granot, Herbert Hamers, Jeroen Kuipers and Michael Maschler (2011): On Chinese postman games where residents of each road pay the cost of their road. Games and Economic Behavior, 72(2):427-438 (T25).

T.J. de Jong, P.G.L. Klinkhamer, A.Shmida, F. Thuijsman (2011): On the evolution of protandry and the difference between preference and rank order in pollinator visitation. Evolutionary Ecology Research 13, 307-314.

Nijssen, J.A.M. and Winands, M.H.M. (2011). Monte-Carlo Tree Search for the Game of Scotland Yard. In 2011 IEEE Conference on Computational Intelligence and Games (CIG 2011) (ed. S.B. Cho, S.M. Lucas, P. Hingston), pp. 158-165. IEEE.

Nijssen, J.A.M. and Winands, M.H.M. (2011). Enhancements for Multi-Player Monte-Carlo Tree Search. In Computers and Games (CG 2010), Lecture Notes in Computer Science (LNCS 6515), pp. 238-249. © Springer, Berlin Heidelberg.

M.P.D. Schadd (2011), Selective Search in Games of Different Complexity, PhD thesis, Maastricht University.

Schadd, M.P.D. and Winands, M.H.M. (2011). Best Reply Search for Multi-Player Games. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 3, No. 1, pp. 57-66.

Winands, M.H.M. and Björnsson, Y. (2011). αβ-based Play-outs in Monte-Carlo Tree Search. In 2011 IEEE Conference on Computational Intelligence and Games (CIG 2011) (ed. S.B. Cho, S.M. Lucas, P. Hingston), pp. 110-117. IEEE.

Winands, M.H.M. and Schadd, M.P.D. (2011). Evaluation-Function Based Proof-Number Search. In Computers and Games (CG 2010), Lecture Notes in Computer Science (LNCS 6515), pp. 23-35. © Springer, Berlin Heidelberg.

2010

Guillaume Chaslot (2010) Monte-Carlo Tree Search, PhD thesi,s Maastricht University.

Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud: Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search (2010). In Advances in Computer Games (ACG 2009). Lecture Notes in Computer Science (LNCS 6048): 1-13

J. Derks, G. van der Laan, V.A. Vasil’ev (2010): On the Harsanyi payoff vectors and Harsanyi imputations. Theory and Decision 68 (3), 301-310.

J. Flesch, J. Kuipers, A. Mashiah-Yaakovi, G. Schoenmakers, E. Solan, K. Vrieze (2010): Perfect-Information Games with Lower-Semi-Continuous Payoffs. Mathematics of Operations Research 35 (4), 742-755.

J. Flesch, J. Kuipers, G. Schoenmakers, K. Vrieze (2010): Subgame-Perfection in Positive Recursive Games with Perfect Information. Mathematics of Operations Research 35 (1), 193-207.

Jeroen Kuipers, Dries Vermeulen and Mark Voorneveld (2010): A generalization of the shapley-ichiishi result. International Journal of Game Theory, 39:585-602.

Marc J. V. Ponsen, Geert Gerritsen, Guillaume Chaslot: Integrating Opponent Models with Monte-Carlo Tree Search in Poker. Interactive Decision Theory and Game Theory 2010

Jahn Saito (2010) Solving Difficult Game Positions, PhD thesis, Maastricht University.

Saito, J-T. and Winands, M.H.M. (2010). Paranoid Proof-Number Search. In 2010 IEEE Conference on Computational Intelligence and Games (CIG 2010) (eds. G.N. Yannakakis and J. Togelius), pp. 203-210. IEEE.

Saito, J-T., Winands, M.H.M., and Herik, H.J. van den (2010). Randomized Parallel Proof-Number Search. In Advances in Computer Games (ACG 2009). Lecture Notes in Computer Science (LNCS 6048), pp. 75-87. © Springer, Berlin Heidelberg.

Skowronski, P., Björnsson, Y., and Winands, M.H.M. (2010). Automated Discovery of Search-Extension Features. In Advances in Computer Games (ACG 2009). Lecture Notes in Computer Science (LNCS 6048), pp. 182-194. © Springer, Berlin Heidelberg.

St-Pierre, D.L., Winands, M.H.M., and Watt, D.A. (2010). A Selective Move Generator for the Game Axis and Allies. In 2010 IEEE Conference on Computational Intelligence and Games (CIG 2010), (eds. G.N. Yannakakis and J. Togelius), pp. 162-169. IEEE.

Istvan Szita, Guillaume Chaslot, Pieter Spronck (2010). Monte-Carlo Tree Search in Settlers of Catan. In Advances in Computer Games (ACG 2009). Lecture Notes in Computer Science (LNCS 6048), pp. 21-32

M. Tennekes (2010) Network Formation Games, PhD thesis Maastricht University.

Winands, M.H.M., Björnsson, Y., and Saito, J-T. (2010). Monte Carlo Tree Search in Lines of Action. IEEE Transactions on Computational Intelligence and AI in Games. Vol. 2, No. 4, pp. 239-250.

Winands, M.H.M. and Björnsson, Y. (2010). Evaluation Function Based Monte-Carlo LOA. In Advances in Computer Games (ACG 2009). Lecture Notes in Computer Science (LNCS 6048), pp. 33-44. © Springer, Berlin Heidelberg.

2009

Pierre Audouard, Guillaume Chaslot, Jean-Baptiste Hoock, Julien Perez, Arpad Rimmel, Olivier Teytaud (2009) Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go. EvoWorkshops 2009: 323-332

Chaslot, G.M.J-B., Hoock, J-B., Perez, J., Rimmel, A., Teytaud O., and Winands, M.H.M. (2009). Meta Monte-Carlo Tree Search for Automatic Opening Book Generation. Proceedings of the IJCAI’09 Workshop on General Intelligence in Game Playing Agents, pp. 7-12.

Guillaume Chaslot, Jean-Baptiste Hoock, Fabien Teytaud, Olivier Teytaud (2009) On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers. Proceedings of the 17th European Symposium on Artificial Neural Networks ESANN 2009, 189-194.

Guillaume Chaslot, L. Chatriot, Christophe Fiter, Sylvain Gelly, Jean-Baptiste Hoock, Julien Perez, Arpad Rimmel, Olivier Teytaud: Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l’exploration Monte-Carlo. Apprentissage et MC. Revue d’Intelligence Artificielle 23(2-3): 203-220 (2009)

J. Derks, J. Kuipers, M. Tennekes, F. Thuijsman (2009): Existence of Nash networks in the one-way flow model of network formation. In: Modeling, Computation and Optimization, Eds S.K. Neogy, A.K. Das, R.B. Bapat, World Scientific, 9-20.

J. Derks, M. Tennekes (2009): A note on the existence of Nash networks in one-way flow models. Economic Theory 41, 515–522.

J. Flesch, G. Schoenmakers, K. Vrieze (2009): Stochastic Games on a Product State Space: The Periodic Case. International Journal of Game Theory 38 (2), 263-289.

M. Kaisers, K. Tuyls, F. Thuijsman, S. Parsons (2009): An evolutionary model of multi-agent learning with a varying exploration rate (Short Paper), Kaisers et al., Proc. of 8th Int. Conf. on Autonomous Agents and Multiagent Systems (AA-MAS 2009), Decker, Sichman, Sierra and Castelfranchi (eds.), May, 10–15, 2009, Budapest, Hungary, 1255-1256.

J. Kuipers, J. Flesch, G. Schoenmakers, K. Vrieze (2009): Pure Subgame-Perfect Equilibria in Free Transition Games. European Journal of Operational Research 199 (2), 442-447.

Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai, Shun-Chin Hsu, Tzung-Pei Hong (2009): The Computational Intelligence of MoGo Revealed in Taiwan’s Computer Go Tournaments. IEEE Trans. Comput. Intellig. and AI in Games 1(1): 73-89.

Chang-Shing Lee, Mei-Hui Wang, Tzung-Pei Hong, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yau-Hwang Kuo: A novel ontology for computer go knowledge management. FUZZ-IEEE 2009: 1056-1061

Nijssen, J.A.M. and Uiterwijk, J.W.H.M. (2009). Using Intelligent Search Techniques to Play the Game Khet. BNAIC 2009. Proceedings of the 21st Benelux Conference on Artificial Intelligence (eds. T. Calders, K. Tuyls, and M. Pechenizkiy), pp. 185-192. Eindhoven, the Netherlands.

Schadd, M.P.D. and Winands, M.H.M. (2009). Quiescence Search for Stratego. In Proceedings of the Twenty-First Benelux Conference on Artificial Intelligence (BNAIC 2009) (eds. T. Calders, K. Tuyls, and M. Pechenizkiy), pp. 225-232.

Schadd, M.P.D., Winands, M.H.M., and Uiterwijk, J.W.H.M. (2009). ChanceProbcut: Forward Pruning in Chance Nodes. In 2009 IEEE Symposium on Computational Intelligence and Games (CIG’09) (ed. P.L. Lanzi), pp. 178-185. IEEE. ISBN: 978-1-4244-4815-9.

J.A. Stankiewicz and M.P.D. Schadd. Opponent Modeling in Stratego. In BNAIC 2009 T. Calders and K. Tuyls and M. Pechenizkiy, eds., pages 233-240, Eindhoven, The Netherlands, 2009.

Jos Uiterwijk and Kevin Moesker (2009). Mathematical Modelling in TwixT. Proceedings Logic and the Simulation of Interaction and Reasoning 2 Workshop (LSIR2) (ed. B. Löwe), pp. 29-35. IJCAI’09, Pasadena, CA, USA.

Werf, E.C.D. van der and Winands, M.H.M. (2009). Solving Go for Rectangular Boards. ICGA Journal, Vol. 32, No. 2, pp. 77-88.