Bibliographie
[1] M. H. Albert, R. J. Nowakowski, and D. Wo lfe. Lessons in play. A K Peters, 2007.
[2] L. .V Allis. A knowledge-based approach to connect-four. The game is solved :
White wins. Master thesis, Vrije Universitat Amsterdam, 1994.
[3] L. Victor Allis, H. Jaap van den Herik, and M. P. H. Huntjens. Go-Moku Solved by
New Search Techniques. Computati onal lnte lligence, 12 :7-23, 1996.
[4] L.V. Allis, M. van der Meulen, and H. J. Herik. Proof-number search. Artificial
Inte lligence, 66(1) :91-124, 1994.
[5] C. Berge. Packing problems. Stu dies on Graphs and Discrete Programming, Ann.
Dise. Math ., 11 :15, 1981.
[6] E. Berlekamp, J. H. Conway, and R. K. Guy. Winning Wa ys. Academic Press, 1982.
[7] H. Berliner. The B* Tree Search Algorithm : a best-first proof procedure. Artificial
Inte lligence, 12 :23-40, 1979.
[8] H. Berliner, G. Goetsch, M. Campbell, and C. Ebeling. Measuring the performance
potential of chess programs. Artificial Inte lligence, 43(1) :7-21, 1990.
[9] H. J. Berliner and C. McConnell. B* probability based search. Artif. Inte l/. ,
86(1) :97-156, 1996.
[10] D. Billings and Y. Bjornsson. Search and knowledge in lines of action. In ACG,
pages 23 1-248, 2003.
[Il] D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, and
D. Szafron. Approximating game-theoretic optimal strategies for full-scale poker.
In Inte rnationa l Jo int Confe rence on Artificial Inte lligence, volume 18, pages 661668. Citeseer, 2003.
[12] B. Bouzy and T. Cazenave. Computer Go : An AI-Oriented Survey. Artificial Inte lligence, 132(1) :39-103, October 2001.
[13] D. Breuker. Memory versus search in games. Phd thesis, Maastricht University,
1999.
[14] T. Cazenave. Automatic Acquisition of Tactical Go Rules. In Game Programming
Workshop in Japan '96, pages 10-19, Kanagawa, Japan, 1996.
[15] T. Cazenave. Automatic ordering of predicates by metarules. In 5th Inte rnational
Wo rkshop on Metap rog ramming and Meta reasoning in Logic, Bonn, 1996.
[ 16] T. Cazenave. Système d' Apprentissage Par Auto-Observation. Application au jeu
de Go. Phd thesis, Université Paris 6, December 1996.
[1] M. H. Albert, R. J. Nowakowski, and D. Wo lfe. Lessons in play. A K Peters, 2007.
[2] L. .V Allis. A knowledge-based approach to connect-four. The game is solved :
White wins. Master thesis, Vrije Universitat Amsterdam, 1994.
[3] L. Victor Allis, H. Jaap van den Herik, and M. P. H. Huntjens. Go-Moku Solved by
New Search Techniques. Computati onal lnte lligence, 12 :7-23, 1996.
[4] L.V. Allis, M. van der Meulen, and H. J. Herik. Proof-number search. Artificial
Inte lligence, 66(1) :91-124, 1994.
[5] C. Berge. Packing problems. Stu dies on Graphs and Discrete Programming, Ann.
Dise. Math ., 11 :15, 1981.
[6] E. Berlekamp, J. H. Conway, and R. K. Guy. Winning Wa ys. Academic Press, 1982.
[7] H. Berliner. The B* Tree Search Algorithm : a best-first proof procedure. Artificial
Inte lligence, 12 :23-40, 1979.
[8] H. Berliner, G. Goetsch, M. Campbell, and C. Ebeling. Measuring the performance
potential of chess programs. Artificial Inte lligence, 43(1) :7-21, 1990.
[9] H. J. Berliner and C. McConnell. B* probability based search. Artif. Inte l/. ,
86(1) :97-156, 1996.
[10] D. Billings and Y. Bjornsson. Search and knowledge in lines of action. In ACG,
pages 23 1-248, 2003.
[Il] D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, and
D. Szafron. Approximating game-theoretic optimal strategies for full-scale poker.
In Inte rnationa l Jo int Confe rence on Artificial Inte lligence, volume 18, pages 661668. Citeseer, 2003.
[12] B. Bouzy and T. Cazenave. Computer Go : An AI-Oriented Survey. Artificial Inte lligence, 132(1) :39-103, October 2001.
[13] D. Breuker. Memory versus search in games. Phd thesis, Maastricht University,
1999.
[14] T. Cazenave. Automatic Acquisition of Tactical Go Rules. In Game Programming
Workshop in Japan '96, pages 10-19, Kanagawa, Japan, 1996.
[15] T. Cazenave. Automatic ordering of predicates by metarules. In 5th Inte rnational
Wo rkshop on Metap rog ramming and Meta reasoning in Logic, Bonn, 1996.
[ 16] T. Cazenave. Système d' Apprentissage Par Auto-Observation. Application au jeu
de Go. Phd thesis, Université Paris 6, December 1996.