236
BIBLIOGRAPHIE
[17] T. Cazenave. Speedup Mechanisms For Large Learning Systems. In /PMU 1998,
Paris, France, 1998.
[18] T. Cazenave. Iterative Widening. In Proceedings of Wo rkshop of the 2000 Computer
Olympiad, London, 2000.
[ 19] T. Cazenave. Generation of Patterns With External Conditions for the Game of Go.
In H.J. van den Herik and B. Monien, editors, Advance in Computer Garnes 9, pages
275-293. Universiteit Maastricht, Maastricht, 200 1.
[20] T. Cazenave. Iterative Widening. In Proceedings of JJCAJ- 01, Vo l. 1, pages 523528, Seattle, 200 I.
[2 1] T. Cazenave. Abstract Proof Search. In T. Anthony Marsland and Ian Frank, editors,
Computers and Garnes 2000, volume 2063 of Lecture Notes in Computer Sc ience,
pages 39-54. Springer, 2002.
[22] T. Cazenave. Admissible moves in two-player games. In SARA 2002, volume 237 1
of Lecture Notes in Computer Science, pages 52-63, Kananaskis, Alberta, Canada,
2002. Springer.
[23] T. Cazenave. Metarules to improve tactical go knowledge. lnj. Se i., 154(3-4) : 173188, 2003.
[24] T. Cazenave. A Phantom-Go program. In Advances in Computer Garnes 2005,
volume 4250 of Lecture Notes in Computer Science, pages 120-125. Springer, 2006.
[25] T. Cazenave. Nested Monte-Carlo search. In JJCAl, pages 456-46 1, 2009.
[26] T. Cazenave. Partial move A*. In ICTAJ, volume 2, pages 25-3 1, 20 10.
[27] T. Cazenave and N. Jouandeau. To wards deadlock free Sokoban. In Board Garnes
Studies Colloquium, Paris, France, 20 10.
[28] T. Cazenave and Abdallah Saffidine. Score bounded Monte-Carlo tree search. In
Computers and Garnes, 20 10.
[29] J. H. Conway. On Numbers and Garnes. Academic Press, London/New-York, 1976.
[30] J. C. Culberson and J. Schaeffer. Pattern Databases. Computational Intelligence,
4(14) :31 8-334, 1998.
[31] G. Dejong and R. Mooney. Explanation based learning : an alternative view. Ma
chine Learning, 1 (2), 1986.
[32] E. D. Demaine, M. L. Demaine, and D. Eppstein. Phutball endgames are hard. In
R. J. Nowakowski, editor, More Garnes of No Chance, MSRI Publications. Cambridge Univ. Press, 2002.
[33] A. Felner, R. E. Korf, and S. Hanan. Additive pattern database heuristics. J. Artif.
lntell. Res. (JAJR) , 22 :279-3 18, 2004.
[34] A. Felner, R. E. Korf, R. Meshulam, and R. C. Holte. Compressed pattern databases.
J. Artif. lntell. Res. (JAIR), 30 :213-247, 2007.
[35] Fuego. http ://fuego.sourceforge.net/. Technical report.
[36] S. Gelly and D. Silver. Combining online and offtine knowledge in UCT. In ICML,
pages 273-280, 2007.
[37] M. L. Ginsberg. Partition Search. In Howard Shrobe and Ted Senator, editors,
AAAI-96, pages 228-233, Menlo Park, California, 1996. AAAI Press.
BIBLIOGRAPHIE
[17] T. Cazenave. Speedup Mechanisms For Large Learning Systems. In /PMU 1998,
Paris, France, 1998.
[18] T. Cazenave. Iterative Widening. In Proceedings of Wo rkshop of the 2000 Computer
Olympiad, London, 2000.
[ 19] T. Cazenave. Generation of Patterns With External Conditions for the Game of Go.
In H.J. van den Herik and B. Monien, editors, Advance in Computer Garnes 9, pages
275-293. Universiteit Maastricht, Maastricht, 200 1.
[20] T. Cazenave. Iterative Widening. In Proceedings of JJCAJ- 01, Vo l. 1, pages 523528, Seattle, 200 I.
[2 1] T. Cazenave. Abstract Proof Search. In T. Anthony Marsland and Ian Frank, editors,
Computers and Garnes 2000, volume 2063 of Lecture Notes in Computer Sc ience,
pages 39-54. Springer, 2002.
[22] T. Cazenave. Admissible moves in two-player games. In SARA 2002, volume 237 1
of Lecture Notes in Computer Science, pages 52-63, Kananaskis, Alberta, Canada,
2002. Springer.
[23] T. Cazenave. Metarules to improve tactical go knowledge. lnj. Se i., 154(3-4) : 173188, 2003.
[24] T. Cazenave. A Phantom-Go program. In Advances in Computer Garnes 2005,
volume 4250 of Lecture Notes in Computer Science, pages 120-125. Springer, 2006.
[25] T. Cazenave. Nested Monte-Carlo search. In JJCAl, pages 456-46 1, 2009.
[26] T. Cazenave. Partial move A*. In ICTAJ, volume 2, pages 25-3 1, 20 10.
[27] T. Cazenave and N. Jouandeau. To wards deadlock free Sokoban. In Board Garnes
Studies Colloquium, Paris, France, 20 10.
[28] T. Cazenave and Abdallah Saffidine. Score bounded Monte-Carlo tree search. In
Computers and Garnes, 20 10.
[29] J. H. Conway. On Numbers and Garnes. Academic Press, London/New-York, 1976.
[30] J. C. Culberson and J. Schaeffer. Pattern Databases. Computational Intelligence,
4(14) :31 8-334, 1998.
[31] G. Dejong and R. Mooney. Explanation based learning : an alternative view. Ma
chine Learning, 1 (2), 1986.
[32] E. D. Demaine, M. L. Demaine, and D. Eppstein. Phutball endgames are hard. In
R. J. Nowakowski, editor, More Garnes of No Chance, MSRI Publications. Cambridge Univ. Press, 2002.
[33] A. Felner, R. E. Korf, and S. Hanan. Additive pattern database heuristics. J. Artif.
lntell. Res. (JAJR) , 22 :279-3 18, 2004.
[34] A. Felner, R. E. Korf, R. Meshulam, and R. C. Holte. Compressed pattern databases.
J. Artif. lntell. Res. (JAIR), 30 :213-247, 2007.
[35] Fuego. http ://fuego.sourceforge.net/. Technical report.
[36] S. Gelly and D. Silver. Combining online and offtine knowledge in UCT. In ICML,
pages 273-280, 2007.
[37] M. L. Ginsberg. Partition Search. In Howard Shrobe and Ted Senator, editors,
AAAI-96, pages 228-233, Menlo Park, California, 1996. AAAI Press.