Tristan Cazenave

Home * People * Tristan Cazenave



Tristan Cazenave, a French computer scientist, games researcher, entrepreneur, and professor of Computer Science at Lamsade, Paris Dauphine University. In 1996, he received his Ph.D. from Paris 6 University under advisor Jacques Pitrat on a system, learning to play games by observing. His research interests covers search algorithms and computer games. He has written programs for multiple board games and has authored more than one hundred scientific papers on artificial intelligence in games. Since 2017, along with I-Chen Wu and Mark Winands, Tristan Cazenave is Editor-in-Chief of the ICGA Journal.

=Monte-Carlo Go= In April 2000, Tristan Cazenave wrote the Monte-Carlo part of Computer Go survey for the Artificial Intelligence journal, and following a discussion on Monte-Carlo Go with Bruno Bouzy, he re-implemented Bernd Brügmann's program Gobble and compared it to a more simple Monte-Carlo sampling approach, finding only little difference in level. The idea was further developed by Bernard Helmstetter, Bruno Bouzy, Guillaume Chaslot, Rémi Coulom, Yizao Wang and Sylvain Gelly who all much improved Monte-Carlo Go to the point it has become the current best approach to computer Go. Along with Nicolas Jouandeau, Tristan Cazenave is co-author of the Go program GoLois, three times Gold Medal winner in Phantom Go at Computer Olympiads, and along with Abdallah Saffidine co-author of the Hex program Yopt, both applying Monte-Carlo Tree Search. In 2009, Tristan Cazenave and Jean Méhat won the General Game Playing competition at IJCAI 2009 with their program Ary, applying Nested Monte-Carlo Search

=Selected Publications=

1995 ...

 * Tristan Cazenave (1995). Learning and Problem Solving in Gogol, a Go playing program. pdf
 * Tristan Cazenave (1995). Management of Uncertainty in Combinatorial Game Theory. zipped ps
 * Tristan Cazenave (1996). Systeme d'Apprentissage par Auto-Observation. Application au Jeu de Go. Ph.D. thesis, Universite Pierre et Marie Curie, Paris 6, advisor Jacques Pitrat, pdf
 * Bruno Bouzy, Tristan Cazenave (1996). Shared concepts between complex systems and the game of Go. pdf
 * Tristan Cazenave (1996). Learning to forecast by explaining the consequences of actions. pdf
 * Tristan Cazenave (1996). Self fuzzy learning. pdf
 * Tristan Cazenave (1997). Gogol (an Analytical Learning Program). IJCAI'97, pdf
 * Bruno Bouzy, Tristan Cazenave (1997). Using the Object Oriented Paradigm to Model Context in Computer Go. Context'97, pdf
 * Tristan Cazenave (1998). Machine Introspection for Machine Learning. Tucson 1998, pdf
 * Tristan Cazenave (1998). Integration of Different Reasoning Modes in a Go Playing and Learning System. pdf
 * Tristan Cazenave (1998). Strategic Evaluation in Complex Domains. FLAIRS 98, pdf
 * Tristan Cazenave (1998). Metaprogramming Forced Moves. ECAI-98, pdf
 * Tristan Cazenave (1998). Learning with Fuzzy Definitions of Goals. pdf

2000
2001 2002 2003 2004
 * Tristan Cazenave (2000). Discovering Search Algorithms with Program Transformation. ps
 * Tristan Cazenave (2000). Generating Search Knowledge in a Class of Games. zipped ps
 * Tristan Cazenave (2000). Iterative Widening. 5th Computer Olympiad Workshop, pdf
 * Tristan Cazenave (2000). Abstract Proof Search. CG 2000, pdf
 * Tristan Cazenave (2001). Generating Patterns with External Conditions for the Game of Go. Advances in Computer Games 9, pdf
 * Bruno Bouzy, Tristan Cazenave (2001). Computer Go: an AI-oriented Survey. Artificial Intelligence Journal, Vol. 132, pdf
 * Tristan Cazenave (2002). Admissible Moves in Two-Player Games. SARA 2002, pdf
 * Tristan Cazenave (2002). A Generalized Threats Search Algorithm. CG 2002, pdf
 * Tristan Cazenave (2002). Gradual Abstract Proof Search. ICGA Journal, Vol. 25 No. 1, pdf
 * Bernard Helmstetter, Tristan Cazenave (2003). Searching with analysis of dependencies in a solitaire card game. Advances in Computer Games 10, pdf
 * Tristan Cazenave (2004). Progressive Random Broadening. pdf
 * Tristan Cazenave (2004). Monte Carlo Real Time Strategy. pdf
 * Bernard Helmstetter, Tristan Cazenave (2004). Incremental Transpositions. CG 2004, pdf, pdf

2005 ...
2006 2007 2008 2009
 * Tristan Cazenave, Bernard Helmstetter (2005). Combining tactical search and Monte-Carlo in the game of Go. IEEE CIG 2005, pdf, pdf
 * Tristan Cazenave (2005). The separation game. JCIS 2005, pdf
 * Tristan Cazenave (2005). A Phantom-Go Program. Advances in Computer Games 11, pdf
 * Tristan Cazenave, Bernard Helmstetter (2005). Search for transitive connections. Information Sciences, Vol. 175 No. 4, pdf
 * Tristan Cazenave (2006). Virtual Global Search: Application to 9×9 Go. CG 2006
 * Tristan Cazenave (2007). Playing the Right Atari. ICGA Journal, Vol. 30, No. 1, pdf
 * Tristan Cazenave, Nicolas Jouandeau (2007). On the Parallelization of UCT. CGW 2007, pdf
 * Tristan Cazenave (2007). Reflexive Monte-Carlo Search. CGW 2007, pdf
 * Michel Quenault, Tristan Cazenave (2007). Extended General Gaming Model. CGW 2007, pdf
 * Tristan Cazenave, Clyde Kruskal, Bruno Bouzy (2007). Computer Games Workshop 2007. ICGA Journal, Vol. 30, No. 2 » CGW 2007
 * Tristan Cazenave, Joris Bosboom (2007). GoLois wins Phantom Go tournament. ICGA Journal, Vol. 30, No. 3, pdf » 12th Computer Olympiad
 * Tristan Cazenave (2007). Evolving Monte-Carlo Tree Search Algorithms. pdf
 * Jean Méhat, Tristan Cazenave (2008). Ary: A Program for General Game Playing. pdf
 * Jean Méhat, Tristan Cazenave (2008). Monte-Carlo Tree Search for General Game Playing. pdf
 * Tristan Cazenave (2008). Multi-player Go. CG 2008
 * Tristan Cazenave, Nicolas Jouandeau (2008). A Parallel Monte-Carlo Tree Search Algorithm. CG 2008, pdf
 * Tristan Cazenave (2009). Nested Monte-Carlo Search. IJCAI 2009, pdf
 * Tristan Cazenave (2009). GoLois wins Phantom-Go tournament. ICGA Journal, Vol. 32, No. 1, pdf » 13th Computer Olympiad
 * Tristan Cazenave (2009). Golois wins Phantom Go Tournament. ICGA Journal, Vol. 32, No 2, pdf
 * Tristan Cazenave, Nicolas Jouandeau (2009). Parallel Nested Monte-Carlo Search. NIDISC 2009, pdf
 * Tristan Cazenave (2009). Monte-Carlo Kakuro. Advances in Computer Games 12, pdf
 * Tristan Cazenave (2009). Nested Monte-Carlo Search. IJCAI 2009, pdf

2010 ...
2011 2012
 * Tristan Cazenave, Abdallah Saffidine (2010). Monte-Carlo Hex. pdf
 * Abdallah Saffidine, Tristan Cazenave, Jean Méhat (2010). UCD : Upper Confidence bound for rooted Directed acyclic graphs. TAAI IWCG, pdf
 * Tristan Cazenave, Abdallah Saffidine (2010). Score Bounded Monte-Carlo Tree Search. CG 2010, pdf
 * Jean Méhat, Tristan Cazenave (2010). Combining UCT and Nested Monte-Carlo Search for Single-Player General Game Playing. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2, No. 4, pdf 2009
 * Jean Méhat, Tristan Cazenave (2011). A Parallel General Game Player. KI Journal, Vol. 25, No. 1, pdf
 * Arpad Rimmel, Fabien Teytaud, Tristan Cazenave (2011). Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows. Evostar 2011, pdf
 * Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. Advances in Computer Games 13 » Breakthrough (Game)
 * Tristan Cazenave, Jean Méhat, Mark Winands (eds.) (2012). Computer Games Workshop at ECAI 2012. ECAI CGW 2012, pdf
 * Tristan Cazenave, Fabien Teytaud (2012). Beam Nested Rollout Policy Adaptation. ECAI CGW 2012
 * Abdallah Saffidine, Tristan Cazenave (2012). A General Multi-Agent Modal Logic K Framework for Game Tree Search. ECAI CGW 2012

2013 2014
 * Mark Winands, Tristan Cazenave (2012). Computer Games Workshop at ECAI 2012. ICGA Journal, Vol. 35, No. 3 » ECAI CGW 2012
 * Abdallah Saffidine, Tristan Cazenave (2012). Multiple-Outcome Proof Number Search. ECAI 2012 » Proof-Number Search
 * Abdallah Saffidine, Tristan Cazenave, Jean Méhat (2012). UCD : Upper confidence bound for rooted directed acyclic graphs. Knowledge Based Systems, Vol. 34
 * Mark Winands, Tristan Cazenave (2013). Computer Games Workshop at IJCAI 2013. ICGA Journal, Vol. 36, No. 3 » IJCAI 2013
 * Abdallah Saffidine, Tristan Cazenave (2013). Developments on Product Propagation. CG 2013
 * Abdallah Saffidine, Nicolas Jouandeau, Cédric Buron, Tristan Cazenave (2013). Material Symmetry to Partition Endgame Tables. CG 2013
 * Tristan Cazenave (2013). GOLOIS Wins Phantom Go Tournament. ICGA Journal, Vol. 36, No. 4 » 17th Computer Olympiad
 * Tristan Cazenave, Mark Winands, Yngvi Björnsson (eds.) (2014). Computer Games. ECAI CGW 2014
 * Nicolas Jouandeau, Tristan Cazenave (2014). Small and Large MCTS Playouts applied to Chinese Dark Chess Stochastic Game. ECAI CGW 2014
 * Alexandre Menif, Éric Jacopin, Tristan Cazenave (2014). SHPE: HTN Planning for Video Games. ECAI CGW 2014
 * Tom Pepels, Tristan Cazenave, Mark Winands, Marc Lanctot (2014). Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search. ECAI CGW 2014


 * Mark Winands, Tristan Cazenave (2014). ECAI Computer Games Workshop. ICGA Journal, Vol. 37, No. 4 » ECAI CGW 2014

2015 ...

 * Tristan Cazenave (2015). Playout Policy Adaptation for Games. Advances in Computer Games 14
 * Jialin Liu, Olivier Teytaud, Tristan Cazenave (2016). Fast seed-learning algorithms for games. CG 2016
 * Mark Winands, Tristan Cazenave (2017). IJCAI Computer Games Workshop 2015. ICGA Journal, Vol. 39, No. 1 » IJCAI 2015
 * Tristan Cazenave (2017). Residual Networks for Computer Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. PP, No. 99, pdf
 * Tristan Cazenave (2017). Improved Policy Networks for Computer Go. Advances in Computer Games 15, pdf
 * Tristan Cazenave (2017). Nested Rollout Policy Adaptation with Selective Policies. Computer Games

=External Links=
 * Tristan Cazenave homepage
 * Tristan Cazenave's ICGA Tournaments
 * The Mathematics Genealogy Project - Tristan Cazenave
 * Cazenave, Tristan from computer-go.info

=References=

Up one level