BIBLIOGRAPHIE
239
[77) J. Schaeffer. Conspiracy Numbers. Artificial Intelligence, 43 :67-84, 1990.
[78) J. Schaeffer. One lump Ahead : Challenging Human Supremacy at Checkers.
Springer-Verlag, New Yo rk, NY, 1997.
[79) J. Schaeffer. Search ideas in chinook. In Jaap van den Herik and Hiroyuki Iida,
editors, Garnes in Al Research, pages 19-30. 2000.
[80) J. Schaeffer, N. Burch, Y. Bjornsson, A. Kishimoto, M. Muller, R. Lake, P. Lu, and
S. Sutphen. Checkers is solved. Science, 317(5844) :1518, 2007.
[81) M. Seo, H. lida, and J. W. H. M. Uiterwijk. The pn * -search algorithm : Application
to tsume-shogi. Artif. Intel!. , 129(1 -2) :253-277, 2001.
[82) D. Silver. Cooperative pathfinding. In AIIDE, pages 117-122, 2005.
[83) H. Simonis. Sudoku as a constraint problem. Proc. 4th /nt. Wo rks. Mode lling and
Reformulating Constraint Satisfaction Problems, pages .13-27, 2005.
[84] G.C. Stockman. A minimax algorithm better than Alpha-Beta ? Artificial Intelligence, 12 :179-196, 1979.
[85) B. Stout. Smart moves : Intelligent path-finding. Game Developper Ma gazine.,
pages 28-35, October 1996.
[86) O. D. Tabibi and N. S. Netanyahu. Ve rified null-move pruning. /CGA Jo urnal,
25(3) : 153-161, September 2002.
[87] K. Thompson. Retrograde analysis of certain endgames. ICCA Jo urnal, 9(3) : 131139, 1986.
[88] K. Thompson. 6-piece endgames. ICCA Jo urnal, 19(4) :215-226, 1996.
[89] T. Thomsen. Lambda-search in game trees - with application to Go. /CGA Jo urnal,
23(4) :203-217, 2000.
[90] K. C. Wang and A. Botea. Tractable multi-agent path planning on grid maps. In
/JCAI, pages 1870-1875, 2009.
[91] K. C. Wang and A. Botea. Scalable multi-agent pathfinding on grid maps with
tractability and completeness guarantees. In ECAI, pages 977-978, 20 10.
[92] M. H. M. Winands and Y. Bjornsson. Evaluation fonction based monte-carlo loa. In
ACG, pages 33-44, 2009.
[93] M. H. M. Winands, Y. Bjornsson, and J. Saito. Monte-carlo tree search solver. In
Computers and Garnes, pages 25-36, 2008.
[94] A. Zobrist. A new hashing method with application for game playing. Te chnical
Report 88, Computer Science Department, University of Wisconsin, Madison, 1970.
239
[77) J. Schaeffer. Conspiracy Numbers. Artificial Intelligence, 43 :67-84, 1990.
[78) J. Schaeffer. One lump Ahead : Challenging Human Supremacy at Checkers.
Springer-Verlag, New Yo rk, NY, 1997.
[79) J. Schaeffer. Search ideas in chinook. In Jaap van den Herik and Hiroyuki Iida,
editors, Garnes in Al Research, pages 19-30. 2000.
[80) J. Schaeffer, N. Burch, Y. Bjornsson, A. Kishimoto, M. Muller, R. Lake, P. Lu, and
S. Sutphen. Checkers is solved. Science, 317(5844) :1518, 2007.
[81) M. Seo, H. lida, and J. W. H. M. Uiterwijk. The pn * -search algorithm : Application
to tsume-shogi. Artif. Intel!. , 129(1 -2) :253-277, 2001.
[82) D. Silver. Cooperative pathfinding. In AIIDE, pages 117-122, 2005.
[83) H. Simonis. Sudoku as a constraint problem. Proc. 4th /nt. Wo rks. Mode lling and
Reformulating Constraint Satisfaction Problems, pages .13-27, 2005.
[84] G.C. Stockman. A minimax algorithm better than Alpha-Beta ? Artificial Intelligence, 12 :179-196, 1979.
[85) B. Stout. Smart moves : Intelligent path-finding. Game Developper Ma gazine.,
pages 28-35, October 1996.
[86) O. D. Tabibi and N. S. Netanyahu. Ve rified null-move pruning. /CGA Jo urnal,
25(3) : 153-161, September 2002.
[87] K. Thompson. Retrograde analysis of certain endgames. ICCA Jo urnal, 9(3) : 131139, 1986.
[88] K. Thompson. 6-piece endgames. ICCA Jo urnal, 19(4) :215-226, 1996.
[89] T. Thomsen. Lambda-search in game trees - with application to Go. /CGA Jo urnal,
23(4) :203-217, 2000.
[90] K. C. Wang and A. Botea. Tractable multi-agent path planning on grid maps. In
/JCAI, pages 1870-1875, 2009.
[91] K. C. Wang and A. Botea. Scalable multi-agent pathfinding on grid maps with
tractability and completeness guarantees. In ECAI, pages 977-978, 20 10.
[92] M. H. M. Winands and Y. Bjornsson. Evaluation fonction based monte-carlo loa. In
ACG, pages 33-44, 2009.
[93] M. H. M. Winands, Y. Bjornsson, and J. Saito. Monte-carlo tree search solver. In
Computers and Garnes, pages 25-36, 2008.
[94] A. Zobrist. A new hashing method with application for game playing. Te chnical
Report 88, Computer Science Department, University of Wisconsin, Madison, 1970.