Maarten P. D. Schadd,
a Dutch computer scientist, product consultant, and previously postdoc at Maastricht University with a Ph.D. in Selective Search in Games of Different Complexity[1]. His research interests include computational complexity of board games, specially the games of Fanorona, SameGame, Stratego and Chinese Checkers. He is author of the Stratego program Hobbes[2]. At the WCCC 2007 in Amsterdam, Maarten was member of the Zappa team, and operated the program on site.
Maarten Schadd, Mark Winands, Jaap van den Herik, Huib Aldewereld (2008). Addressing NP-Complete Puzzles with Monte-Carlo Methods. In Volume 9: Proceedings of the AISB 2008 Symposium on Logic and the Simulation of Interaction and Reasoning, pages 55-61, Brighton, UK, 2008. The Society for the study of Artificial Intelligence and Simulation of Behaviour. pdf
Maarten Schadd, Mark Winands, Jos Uiterwijk (2009). ChanceProbCut: Forward Pruning in Chance Nodes. IEEE Symposium on Computational Intelligence and Games (CIG 2009), pdf
a Dutch computer scientist, product consultant, and previously postdoc at Maastricht University with a Ph.D. in Selective Search in Games of Different Complexity [1]. His research interests include computational complexity of board games, specially the games of Fanorona, SameGame, Stratego and Chinese Checkers. He is author of the Stratego program Hobbes [2]. At the WCCC 2007 in Amsterdam, Maarten was member of the Zappa team, and operated the program on site.
Table of Contents
Selected Publications
[4]2005 ...
2010 ...
External Links
References
What links here?
Up one level