L. Victor and A. , Searching for Solutions in Games an Articial Intelligence, 1994.

L. Victor-allis, M. Van-der-meulen, and H. , Jaap van den Herik. Proof-Number Search, Articial Intelligence, vol.66, issue.1, p.91124, 1994.

D. Michel-breuker, Memory versus Search in Games, 1998.

M. Brockington, APHID: Asynchronous Parallel Game-Tree Search, Journal of Parallel and Distributed Computing, vol.60, issue.2, 1997.
DOI : 10.1006/jpdc.1999.1600
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.9870

T. Cazenave and N. Jouandeau, On the parallelization of UCT, Proceedings of the Computer Games Workshop, p.93101, 2007.

G. Chaslot, M. Winands, and H. , Jaap van Den Herik. Parallel montecarlo tree search, Computers and Games, p.6071, 2008.

M. Enzenberger and M. Müller, A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm, Advances in Computer Games, p.1420, 2010.
DOI : 10.1007/978-3-642-12993-3_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.1984

R. Feldmann, P. Mysliwietz, and B. Monien, Distributed game tree search on a massively parallel system, Advances in Computer Chess 7, p.203219, 1993.
DOI : 10.1007/3-540-55488-2_32

H. Finnsson and Y. Björnsson, Game-tree properties and mcts performance, Proceedings of the IJCAI Workshop on General Intelligence in Game- Playing Agents (GIGA'11), p.2330, 2011.

K. Handscomb, 8 × 8 game design competition: The winning game: Breakthrough ... and two other favorites, Abstract Games Magazine, vol.7, p.89, 2001.

T. Kaneko, Parallel depth rst proof number search, AAAI, 2010.

A. Kishimoto and J. Schaeer, Distributed game-tree search using transposition table driven work scheduling, Proceedings International Conference on Parallel Processing, p.323330, 2002.
DOI : 10.1109/ICPP.2002.1040888
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.8604

A. Kishimoto and Y. Kotani, Parallel and/or tree search based on proof and disproof numbers, Game Programming Workshop in Japan, p.2430, 1999.

A. Nagai, A new and/or tree search algorithm using proof number and disproof number, Complex Games Lab Workshop, p.4045, 1998.

A. Nagai, Df-pn algorithm for searching AND/OR trees and its applications, 2002.

J. Saito, M. H. Winands, and H. , Jaap van den Herik. Randomized parallel proof-number search, Advances in Computer Games, Lecture Notes in Computer Science, p.7587

P. D. Maarten, M. H. Schadd, J. W. Winands, H. Uiterwijk, M. H. Jaap-van-den-herik et al., Best Play in Fanorona leads to Draw, New Mathematics and Natural Computation, vol.4, issue.3, p.369387, 2008.

J. Schaeer, N. Burch, Y. Björnsson, A. Kishimoto, M. Müller et al., Checkers is solved, Science, issue.5844, p.3171518, 2007.

P. Skowronski, Y. Björnsson, and M. Winands, Automated Discovery of Search-Extension Features, Advances in Computer Games, p.182194, 2010.
DOI : 10.1007/978-3-642-12993-3_17

I. Wu, H. Lin, P. Lin, D. Sun, Y. Chan et al., Job-Level Proof-Number Search for Connect6, H. Jaap van den Herik, Hiroyuki Iida, and Aske Plaat Computers and Games, p.1122, 2010.
DOI : 10.1007/978-3-642-17928-0_2