Hendrik Baier

Home * People * Hendrik Baier



Hendrik Baier, a German computer scientist with a Ph.D. degree in 2015 from the Games and AI group around Mark Winands at Department of Knowledge Engineering, Maastricht University. His research focused on Monte-Carlo Tree Search in Go, and on Monte-Carlo hybrids, employing minimax with an evaluation function in the rollout phase and move selection of MCTS - with encouraging results in the domains of Othello and Dōbutsu shōgi (Let's Catch the Lion). Hendrik Baier holds a Bachelor's degree in 2006 from Darmstadt University of Technology, and a Master's degree in 2010 from University of Osnabrück already on Monte-Carlo Go.

=Connect Four= Despite being solved by James D. Allen (October 1, 1988), and independently by Victor Allis (October 16, 1988), Connect Four is still an interesting game for humans, and also suited as testbed for search algorthms. Hendrik Baier's 2006 Bachelor's thesis deals with alpha-beta with improvements and evaluation in this domain.

=Selected Publications=

2006 ...

 * Hendrik Baier (2006). Der Alpha-Beta-Algorithmus und Erweiterungen bei Vier Gewinnt. Bachelor's thesis (German), TU Darmstadt, advisor Johannes Fürnkranz, pdf

2010 ...

 * Hendrik Baier (2010). Adaptive Playout Policies for Monte-Carlo Go. Master's thesis, University of Osnabrück, pdf
 * Hendrik Baier, Peter D. Drake (2010). The power of forgetting: Improving the last-good-reply policy in Monte Carlo Go. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 2, No. 4
 * Hendrik Baier, Mark Winands (2011). Active Opening Book Application for Monte-Carlo Tree Search in 19x19 Go. BNAIC 2011, pdf
 * Hendrik Baier, Mark Winands (2011). Time Management for Monte-Carlo Tree Search in Go. Advances in Computer Games 13
 * Hendrik Baier, Mark Winands (2012). Nested Monte-Carlo Tree Search for Online Planning in Large MDPs. ECAI 2012, pdf
 * Hendrik Baier, Mark Winands (2012). Beam Monte-Carlo Tree Search. CIG 2012, pdf
 * Hendrik Baier, Mark Winands (2013). Monte-Carlo Tree Search and minimax hybrids. CIG 2013, pdf
 * Hendrik Baier, Mark Winands (2014). Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions. ECAI CGW 2014

2015 ...

 * Hendrik Baier (2015). Monte-Carlo Tree Search Enhancements for One-Player and Two-Player Domains. Ph.D. thesis, Maastricht University, pdf
 * Hendrik Baier, Mark Winands (2016). Time Management for Monte Carlo Tree Search. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 8, No. 3, draft as pdf
 * Hendrik Baier (2017). A Rollout-Based Search Algorithm Unifying MCTS and Alpha-Beta. Computer Games » Rollout Paradigm

=Forum Posts=
 * [Computer-go learning patterns for mc go] by Hendrik Baier, Computer Go Archive, April 26, 2010
 * Re: [Computer-go Computer-go Digest, Vol 12, Issue 79] by Hendrik Baier, Computer Go Archive, January 26, 2011
 * Re: [Computer-go Computer-go Digest, Vol 12, Issue 81] by Hendrik Baier, Computer Go Archive, January 26, 2011
 * [Computer-go 2nd CFP: DKE Symposium "Driven by Search"] by Hendrik Baier, Computer Go Archive, May 18, 2011
 * Re: [Computer-go Computer-go Digest, Vol 17, Issue 78] by Hendrik Baier, Computer Go Archive, June 29, 2011
 * Re: [Computer-go Computer-go Digest, Vol 18, Issue 29] by Hendrik Baier, Computer Go Archive, July 11, 2011

=External Links=
 * Hendrik Baier's website
 * Hendrik Baier - Games and AI Group
 * Hendrik Baier - Google Scholar Citations

=References=

Up one level