A. Bolognesi and P. Ciancarini, Searching over Metapositions in Kriegspiel, 4th Int. Conf. on Computer and Games, 2004.
DOI : 10.1007/11674399_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.871

M. Campbell and T. Marsland, A comparison of minimax tree search algorithms, Artificial Intelligence, vol.20, issue.4, pp.347-367, 1983.
DOI : 10.1016/0004-3702(83)90001-2

T. Cazenave, A Phantom-Go Program, Advances in Computer Games, number 4250 in Lecture Notes in Computer Science, pp.120-125, 2006.
DOI : 10.1007/11922155_9

P. Ciancarini, F. Dallalibera, and F. Maran, Decision Making under Uncertainty: A Rational Approach to Kriegspiel, Advances in Computer Chess 8, pp.277-298, 1997.

P. Ciancarini and G. Favini, Representing Kriegspiel States with Metapositions, Proc. 20th Int. Joint Conf. on Artificial Intelligence (IJCAI 07), pp.2450-2455, 2007.

P. Ciancarini and G. Favini, Monte Carlo tree search in Kriegspiel, Artificial Intelligence, vol.174, issue.11, pp.670-684, 2010.
DOI : 10.1016/j.artint.2010.04.017
URL : http://doi.org/10.1016/j.artint.2010.04.017

L. Kocsis and C. Szepesvari, Bandit Based Monte-Carlo Planning, Proc. 15th European Conference on Machine Learning, number 4212 in Lecture Notes in Computer Science, pp.282-293, 2006.
DOI : 10.1007/11871842_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.1296

M. Chung, M. Buro, and J. Schaeffer, Monte Carlo planning in RTS games, Proc. IEEE Symposium on Computational Intelligence and Games, pp.117-124, 2005.

P. Perla, The Art of Wargaming, 1990.

M. Sakuta, Deterministic Solving of Problems with Uncertainty, 2001.

C. Shannon, Programming a Computer for Playing Chess, Philosophical Magazine (Series, vol.7, pp.256-275, 1950.
DOI : 10.1007/978-1-4757-1968-0_1

K. Thompson, Computer Chess Strenght, Advances in Computer Chess 3, pp.55-56, 1982.

E. Zermelo, On an Application of Set Theory to the Theory of the Game of Chess, Proceedings of the Fifth International Congress of Mathematicians, pp.501-504, 1913.