Tristan Cazenave

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Tristan Cazenave

Tristan Cazenave [1]

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 [2] . 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 [3] 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 [4] . Along with Nicolas Jouandeau, Tristan Cazenave is co-author of the Go program GoLois, three times Gold Medal winner in Phantom Go [5] 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 [6] , applying Nested Monte-Carlo Search [7]

Selected Publications

[8] [9]

1995 ...

2000

2001

2002

2003

2004

2005 ...

2006

2007

2008

2009

2010 ...

2011

2012

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

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

2015 ...

External Links

References

  1. Tristan Cazenave homepage
  2. 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
  3. Gobble
  4. Tristan Cazenave - Biography
  5. Go Variants - Phantom go
  6. Jean Méhat, Tristan Cazenave (2008). Ary: A Program for General Game Playing. pdf
  7. Tristan Cazenave (2009). Nested Monte-Carlo Search. IJCAI 2009, pdf
  8. Tristan Cazenave - Papers Sorted by Year
  9. DBLP: Tristan Cazenave
  10. Residual Networks for Computer Go by Brahim Hamadicharef, CCC, December 07, 2017

Up one level