T. Kasai, A. Adachi, and S. Iwata, Classes of Pebble Games and Complete Problems, SIAM Journal on Computing, vol.8, issue.4, pp.574-586, 1979.
DOI : 10.1137/0208046

G. Viglietta, Gaming is a hard job, but someone has to do it! " in Fun with Algorithms, pp.357-367, 2012.

E. Bonnet, F. Jamain, and A. Saffidine, On the complexity of tricktaking card games, 23rd International Joint Conference on Artificial Intelligence (IJCAI), 2013.
URL : https://hal.archives-ouvertes.fr/hal-01343394

B. Robertie, Complexity table Inside Backgammon, p.4, 1980.

S. Yen, J. Chen, T. Yang, and S. Hsu, Computer chinese chess, ICGA Journal, vol.27, issue.1, pp.3-18, 2004.

J. M. Robson, The complexity of go, IFIP Congress, pp.413-417, 1983.

G. Tesauro, TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play, Neural Computation, vol.23, issue.2, pp.215-219, 1994.
DOI : 10.1162/neco.1989.1.3.321

D. Billings, Algorithms and assessment in computer poker, 2006.

S. Yen, J. Chen, B. Chen, and W. Tseng, DARKNIGHT Wins Chinese Dark Chess Tournament, ICGA Journal, vol.36, issue.3, pp.175-176, 2013.
DOI : 10.3233/ICG-2013-36315

X. Deng and Q. Qi, Priority right auction for komi setting, Internet and Network Economics, ser. Lecture Notes in Computer Science, pp.521-528, 2009.

H. Parker, Ancient Ceylon : An Account of the Aborigines and of Part of the Early Civilisation, 1909.

B. Arneson, R. Hayward, and P. Henderson, Mohex wins hex tournament, ICGA journal, pp.114-116, 2009.

F. Teytaud and O. Teytaud, Creating an Upper-Confidence-Tree Program for Havannah, ACG 12, 2009.
DOI : 10.1007/978-3-642-12993-3_7
URL : https://hal.archives-ouvertes.fr/inria-00380539

J. Sonas, Overall review of the fide rating system, 2013.

R. K. Hambleton, H. Swaminathan, H. J. Rogers-ronald, K. Hambleton, H. Swaminathan et al., Fundamentals of item response theory, 1991.