238
BIBLIOGRAPHIE
[58] R. J. Lorentz. Amazons discover monte-carlo. In Computers and Garnes, pages
13-24, 2008.
[59] D. A. McAllester. Conspiracy numbers for min-max search. Artif. Intell. ,
35(3) :287-3 10, 1988.
[60] J. Méhat and T. Cazenave. Combining UCT and Nested Monte-Carlo Search for
Single-Player General Game Playing. IEEE Tra nsactions on Computational Intelligence and Artificial Intelligence in Garnes, 20 10.
[61] D. Michie. A theory of advice. Ma chine Intelligence, 8 :15 1-170, 1977.
[62] J. A. Michon. The game of JAM : An isomorph of tic-tac-toe. American Journal of
Psychology, 80 :137-140, 1967.
[63] T. M. Mitchell, R. M. Keller, and S. T. Kedar-Kabelli. Explanation-based generalization : A unifying view. Ma chine Learning, 1(1), 1986.
[64] A. Nagai. Df-pn algorithm for searching AND/OR trees and its applications. Phd
thesis, Department of Information Science, University of To kyo, 2002.
[65] J. Nunn. Extracting information from endgame databases. ICCA Jo urnal,
16(4) :191-200, 1993.
[66] J. Nunn. Secrets of pawnless endings. Gambit Publications, 2002.
[67] J. Pitrat. Realization of a program Iearning to find combinations at chess. In J. C.
Simon, editor, Computer Oriented Learning Processes, number 14 in Series E: Applied Science, Noordhoff, Leyden, 1976. NATO Advanced Study Institutes Series.
[68] A. Plaat, J. Schaeffer, W. Pils, and A. de Bruin. Best-first fixed depth minimax
algorithms. Artificial Intelligence, 87 :255-293, November 1996.
[69] S. Plenkner. A null-move technique impervious to zugzwang. ICCA Journal,
18(2) :82-84, 1995.
[70] J. W. Romein and H. E. Bal. Solving awari with parallel retrograde analysis. IEEE
Computer, 36(10) :26-33, 2003.
[7 1] D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis. An analysis of several heuristics
for the traveling salesman problem. Fundamental Problems in Computing, pages
45-69, 2009.
[72] A. Sadikov, I. Bratko, and 1. Kononenko. Search versus knowledge : an empirical
study of minimax on krk. In Advances in Computer Garnes : Many Garnes, Many
Challenges, pages 33-44, 2003.
[73] M. P. D. Schadd, M. H. M. Winands, H. J. van den Herik, G. Chaslot, and J. W.
H. M. Uiterwijk. Single-player Monte-Carlo tree search. In Computers and Garnes,
pages 1-12, 2008.
[74] M.P.D. Schadd, M.H.M. Winands, J.W.H.M. Uiterwijk, H.J. van den Herik, and
M.H.J. Bergsma. Best play in fanorona Ieads to draw. New Ma thematics and Na tural
Computation, 4(3) :369-387, 2008.
[75] J. Schaeffer. The history heuristic. ICCA Jo urnal, 6(3) :16-19, 1983.
[76] J. Schaeffer. The history heuristic and alpha-beta search enhancements in practice.
IEEE Tra nsactions on Pa ttern Analysis and Ma chine Intelligence, 11(11) :12031212, 1989.
BIBLIOGRAPHIE
[58] R. J. Lorentz. Amazons discover monte-carlo. In Computers and Garnes, pages
13-24, 2008.
[59] D. A. McAllester. Conspiracy numbers for min-max search. Artif. Intell. ,
35(3) :287-3 10, 1988.
[60] J. Méhat and T. Cazenave. Combining UCT and Nested Monte-Carlo Search for
Single-Player General Game Playing. IEEE Tra nsactions on Computational Intelligence and Artificial Intelligence in Garnes, 20 10.
[61] D. Michie. A theory of advice. Ma chine Intelligence, 8 :15 1-170, 1977.
[62] J. A. Michon. The game of JAM : An isomorph of tic-tac-toe. American Journal of
Psychology, 80 :137-140, 1967.
[63] T. M. Mitchell, R. M. Keller, and S. T. Kedar-Kabelli. Explanation-based generalization : A unifying view. Ma chine Learning, 1(1), 1986.
[64] A. Nagai. Df-pn algorithm for searching AND/OR trees and its applications. Phd
thesis, Department of Information Science, University of To kyo, 2002.
[65] J. Nunn. Extracting information from endgame databases. ICCA Jo urnal,
16(4) :191-200, 1993.
[66] J. Nunn. Secrets of pawnless endings. Gambit Publications, 2002.
[67] J. Pitrat. Realization of a program Iearning to find combinations at chess. In J. C.
Simon, editor, Computer Oriented Learning Processes, number 14 in Series E: Applied Science, Noordhoff, Leyden, 1976. NATO Advanced Study Institutes Series.
[68] A. Plaat, J. Schaeffer, W. Pils, and A. de Bruin. Best-first fixed depth minimax
algorithms. Artificial Intelligence, 87 :255-293, November 1996.
[69] S. Plenkner. A null-move technique impervious to zugzwang. ICCA Journal,
18(2) :82-84, 1995.
[70] J. W. Romein and H. E. Bal. Solving awari with parallel retrograde analysis. IEEE
Computer, 36(10) :26-33, 2003.
[7 1] D.J. Rosenkrantz, R.E. Stearns, and P.M. Lewis. An analysis of several heuristics
for the traveling salesman problem. Fundamental Problems in Computing, pages
45-69, 2009.
[72] A. Sadikov, I. Bratko, and 1. Kononenko. Search versus knowledge : an empirical
study of minimax on krk. In Advances in Computer Garnes : Many Garnes, Many
Challenges, pages 33-44, 2003.
[73] M. P. D. Schadd, M. H. M. Winands, H. J. van den Herik, G. Chaslot, and J. W.
H. M. Uiterwijk. Single-player Monte-Carlo tree search. In Computers and Garnes,
pages 1-12, 2008.
[74] M.P.D. Schadd, M.H.M. Winands, J.W.H.M. Uiterwijk, H.J. van den Herik, and
M.H.J. Bergsma. Best play in fanorona Ieads to draw. New Ma thematics and Na tural
Computation, 4(3) :369-387, 2008.
[75] J. Schaeffer. The history heuristic. ICCA Jo urnal, 6(3) :16-19, 1983.
[76] J. Schaeffer. The history heuristic and alpha-beta search enhancements in practice.
IEEE Tra nsactions on Pa ttern Analysis and Ma chine Intelligence, 11(11) :12031212, 1989.