25,161
edits
Changes
Created page with "'''Home * People * Hendrik Baier''' FILE:Hendrik Baier.jpg|border|right|thumb|link=http://hendrikbaier.jimdo.com/|Hendrik Baier <ref>[http://hendrikbaier...."
'''[[Main Page|Home]] * [[People]] * Hendrik Baier'''
[[FILE:Hendrik Baier.jpg|border|right|thumb|link=http://hendrikbaier.jimdo.com/|Hendrik Baier <ref>[http://hendrikbaier.jimdo.com/ Hendrik Baier's website]</ref> ]]
'''Hendrik Baier''',<br/>
a German computer scientist with a Ph.D. degree in 2015 from the Games and AI group <ref> [https://project.dke.maastrichtuniversity.nl/games/member_hendrik.htm Hendrik Baier - Games and AI Group]</ref> 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|minimax]] with an [[Evaluation|evaluation]] function in the rollout phase and move selection of MCTS - with encouraging results in the domains of [[Othello]] and [https://en.wikipedia.org/wiki/D%C5%8Dbutsu_sh%C5%8Dgi Dōbutsu shōgi] (Let's Catch the Lion) <ref>[[Hendrik Baier]], [[Mark Winands]] ('''2014'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-319-14923-3_4 Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions]''. [[ECAI CGW 2014]]</ref>. Hendrik Baier holds a Bachelor's degree in 2006 from [[Darmstadt University of Technology]] <ref>[[Hendrik Baier]] ('''2006'''). ''Der Alpha-Beta-Algorithmus und Erweiterungen bei Vier Gewinnt''. Bachelor's thesis (German), [[Darmstadt University of Technology|TU Darmstadt]], advisor [[Johannes Fürnkranz]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2006/Baier_Hendrik.pdf pdf]</ref>, and a Master's degree in 2010 from [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck University of Osnabrück] already on Monte-Carlo Go <ref> [[Hendrik Baier]] ('''2010'''). ''Adaptive Playout Policies for Monte-Carlo Go''. Master's thesis, [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck University of Osnabrück], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/master/2010/Baier_Hendrik.pdf pdf]</ref>.
=Connect Four=
Despite being solved by [[James D. Allen]] (October 1, 1988), and independently by [[Victor Allis]] (October 16, 1988) <ref>[https://en.wikipedia.org/wiki/Connect_Four Connect Four from Wikipedia]</ref>, [[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|alpha-beta]] with improvements and [[Evaluation|evaluation]] in this domain.
=Selected Publications=
<ref>[https://hendrikbaier.jimdo.com/publications/ Publications - Hendrik Baier's website]</ref> <ref>[http://dblp.uni-trier.de/pers/hd/b/Baier:Hendrik dblp: Hendrik Baier]</ref>
==2006 ...==
* [[Hendrik Baier]] ('''2006'''). ''Der Alpha-Beta-Algorithmus und Erweiterungen bei Vier Gewinnt''. Bachelor's thesis (German), [[Darmstadt University of Technology|TU Darmstadt]], advisor [[Johannes Fürnkranz]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2006/Baier_Hendrik.pdf pdf]
==2010 ...==
* [[Hendrik Baier]] ('''2010'''). ''Adaptive Playout Policies for Monte-Carlo Go''. Master's thesis, [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck University of Osnabrück], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/master/2010/Baier_Hendrik.pdf pdf] <ref> [https://groups.google.com/d/msg/computer-go-archive/AtJamp8wxSM/QfKf-y1fSQMJ Re: [Computer-go] Computer-go Digest, Vol 12, Issue 79] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], January 26, 2011</ref>
* [[Hendrik Baier]], [[Peter D. Drake]] ('''2010'''). ''The power of forgetting: Improving the last-good-reply policy in Monte Carlo Go''. [[IEEE#TOCIAIGAMES|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''. [http://allserv.kahosl.be/bnaic2011/ BNAIC 2011], [https://dke.maastrichtuniversity.nl/m.winands/documents/bnaic2011Baier.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_4 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''. [http://www2.lirmm.fr/ecai2012/ ECAI 2012], [https://dke.maastrichtuniversity.nl/m.winands/documents/ecai2012.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Markov_decision_process Markov decision process from Wikipedia]</ref>
* [[Hendrik Baier]], [[Mark Winands]] ('''2012'''). ''Beam Monte-Carlo Tree Search''. [http://dblp.uni-trier.de/db/conf/cig/cig2012.html#BaierW12 CIG 2012], [https://dke.maastrichtuniversity.nl/m.winands/documents/CIG2012_paper_32.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2013'''). ''Monte-Carlo Tree Search and minimax hybrids''. [http://dblp.uni-trier.de/db/conf/cig/cig2013.html#BaierW13 CIG 2013], [https://dke.maastrichtuniversity.nl/m.winands/documents/paper%2049.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2014'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-319-14923-3_4 Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions]''. [[ECAI CGW 2014]]
==2015 ...==
* <span id="PhD"></span>[[Hendrik Baier]] ('''2015'''). ''Monte-Carlo Tree Search Enhancements for One-Player and Two-Player Domains''. Ph.D. thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Baier_thesis.pdf pdf] <ref>[[Dap Hartmann]] ('''2017'''). ''Let's Catch the Train to Monte-Carlo''. [[ICGA Journal#39_1|ICGA Journal, Vol. 39, No. 1]]</ref>
* [[Hendrik Baier]], [[Mark Winands]] ('''2016'''). ''Time Management for Monte Carlo Tree Search''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 8, No. 3, [https://dke.maastrichtuniversity.nl/m.winands/documents/time_management_for_monte_carlo_tree_search.pdf draft as pdf]
* [[Hendrik Baier]] ('''2017'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-57969-6_5 A Rollout-Based Search Algorithm Unifying MCTS and Alpha-Beta]''. [https://link.springer.com/book/10.1007%2F978-3-319-57969-6 Computer Games] » [[Bojun Huang#Rollout|Rollout Paradigm]]
=Forum Posts=
* [https://groups.google.com/d/msg/computer-go-archive/JrrSovvgTV0/UbPOufyTApQJ [Computer-go] learning patterns for mc go] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], April 26, 2010
* [https://groups.google.com/d/msg/computer-go-archive/AtJamp8wxSM/QfKf-y1fSQMJ Re: [Computer-go] Computer-go Digest, Vol 12, Issue 79] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], January 26, 2011
* [https://groups.google.com/d/msg/computer-go-archive/Z5TN-EgqA9Y/fzlJ6MPLp3QJ Re: [Computer-go] Computer-go Digest, Vol 12, Issue 81] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], January 26, 2011
* [https://groups.google.com/d/msg/computer-go-archive/eTKDugZ7Hsk/8TB-C4tPyAcJ [Computer-go] 2nd CFP: DKE Symposium "Driven by Search"] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], May 18, 2011
* [https://groups.google.com/d/msg/computer-go-archive/gq0Fy07fUMg/GxQHc_zOndQJ Re: [Computer-go] Computer-go Digest, Vol 17, Issue 78] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], June 29, 2011
* [https://groups.google.com/d/msg/computer-go-archive/-zdc-ZwEXeA/p11k87TcZDgJ Re: [Computer-go] Computer-go Digest, Vol 18, Issue 29] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], July 11, 2011
=External Links=
* [http://hendrikbaier.jimdo.com/ Hendrik Baier's website]
* [https://project.dke.maastrichtuniversity.nl/games/member_hendrik.htm Hendrik Baier - Games and AI Group]
* [https://scholar.google.de/citations?user=QW-CFsoAAAAJ&hl=en Hendrik Baier - Google Scholar Citations]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:Hendrik Baier.jpg|border|right|thumb|link=http://hendrikbaier.jimdo.com/|Hendrik Baier <ref>[http://hendrikbaier.jimdo.com/ Hendrik Baier's website]</ref> ]]
'''Hendrik Baier''',<br/>
a German computer scientist with a Ph.D. degree in 2015 from the Games and AI group <ref> [https://project.dke.maastrichtuniversity.nl/games/member_hendrik.htm Hendrik Baier - Games and AI Group]</ref> 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|minimax]] with an [[Evaluation|evaluation]] function in the rollout phase and move selection of MCTS - with encouraging results in the domains of [[Othello]] and [https://en.wikipedia.org/wiki/D%C5%8Dbutsu_sh%C5%8Dgi Dōbutsu shōgi] (Let's Catch the Lion) <ref>[[Hendrik Baier]], [[Mark Winands]] ('''2014'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-319-14923-3_4 Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions]''. [[ECAI CGW 2014]]</ref>. Hendrik Baier holds a Bachelor's degree in 2006 from [[Darmstadt University of Technology]] <ref>[[Hendrik Baier]] ('''2006'''). ''Der Alpha-Beta-Algorithmus und Erweiterungen bei Vier Gewinnt''. Bachelor's thesis (German), [[Darmstadt University of Technology|TU Darmstadt]], advisor [[Johannes Fürnkranz]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2006/Baier_Hendrik.pdf pdf]</ref>, and a Master's degree in 2010 from [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck University of Osnabrück] already on Monte-Carlo Go <ref> [[Hendrik Baier]] ('''2010'''). ''Adaptive Playout Policies for Monte-Carlo Go''. Master's thesis, [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck University of Osnabrück], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/master/2010/Baier_Hendrik.pdf pdf]</ref>.
=Connect Four=
Despite being solved by [[James D. Allen]] (October 1, 1988), and independently by [[Victor Allis]] (October 16, 1988) <ref>[https://en.wikipedia.org/wiki/Connect_Four Connect Four from Wikipedia]</ref>, [[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|alpha-beta]] with improvements and [[Evaluation|evaluation]] in this domain.
=Selected Publications=
<ref>[https://hendrikbaier.jimdo.com/publications/ Publications - Hendrik Baier's website]</ref> <ref>[http://dblp.uni-trier.de/pers/hd/b/Baier:Hendrik dblp: Hendrik Baier]</ref>
==2006 ...==
* [[Hendrik Baier]] ('''2006'''). ''Der Alpha-Beta-Algorithmus und Erweiterungen bei Vier Gewinnt''. Bachelor's thesis (German), [[Darmstadt University of Technology|TU Darmstadt]], advisor [[Johannes Fürnkranz]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2006/Baier_Hendrik.pdf pdf]
==2010 ...==
* [[Hendrik Baier]] ('''2010'''). ''Adaptive Playout Policies for Monte-Carlo Go''. Master's thesis, [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck University of Osnabrück], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/master/2010/Baier_Hendrik.pdf pdf] <ref> [https://groups.google.com/d/msg/computer-go-archive/AtJamp8wxSM/QfKf-y1fSQMJ Re: [Computer-go] Computer-go Digest, Vol 12, Issue 79] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], January 26, 2011</ref>
* [[Hendrik Baier]], [[Peter D. Drake]] ('''2010'''). ''The power of forgetting: Improving the last-good-reply policy in Monte Carlo Go''. [[IEEE#TOCIAIGAMES|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''. [http://allserv.kahosl.be/bnaic2011/ BNAIC 2011], [https://dke.maastrichtuniversity.nl/m.winands/documents/bnaic2011Baier.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_4 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''. [http://www2.lirmm.fr/ecai2012/ ECAI 2012], [https://dke.maastrichtuniversity.nl/m.winands/documents/ecai2012.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Markov_decision_process Markov decision process from Wikipedia]</ref>
* [[Hendrik Baier]], [[Mark Winands]] ('''2012'''). ''Beam Monte-Carlo Tree Search''. [http://dblp.uni-trier.de/db/conf/cig/cig2012.html#BaierW12 CIG 2012], [https://dke.maastrichtuniversity.nl/m.winands/documents/CIG2012_paper_32.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2013'''). ''Monte-Carlo Tree Search and minimax hybrids''. [http://dblp.uni-trier.de/db/conf/cig/cig2013.html#BaierW13 CIG 2013], [https://dke.maastrichtuniversity.nl/m.winands/documents/paper%2049.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2014'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-319-14923-3_4 Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions]''. [[ECAI CGW 2014]]
==2015 ...==
* <span id="PhD"></span>[[Hendrik Baier]] ('''2015'''). ''Monte-Carlo Tree Search Enhancements for One-Player and Two-Player Domains''. Ph.D. thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Baier_thesis.pdf pdf] <ref>[[Dap Hartmann]] ('''2017'''). ''Let's Catch the Train to Monte-Carlo''. [[ICGA Journal#39_1|ICGA Journal, Vol. 39, No. 1]]</ref>
* [[Hendrik Baier]], [[Mark Winands]] ('''2016'''). ''Time Management for Monte Carlo Tree Search''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 8, No. 3, [https://dke.maastrichtuniversity.nl/m.winands/documents/time_management_for_monte_carlo_tree_search.pdf draft as pdf]
* [[Hendrik Baier]] ('''2017'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-57969-6_5 A Rollout-Based Search Algorithm Unifying MCTS and Alpha-Beta]''. [https://link.springer.com/book/10.1007%2F978-3-319-57969-6 Computer Games] » [[Bojun Huang#Rollout|Rollout Paradigm]]
=Forum Posts=
* [https://groups.google.com/d/msg/computer-go-archive/JrrSovvgTV0/UbPOufyTApQJ [Computer-go] learning patterns for mc go] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], April 26, 2010
* [https://groups.google.com/d/msg/computer-go-archive/AtJamp8wxSM/QfKf-y1fSQMJ Re: [Computer-go] Computer-go Digest, Vol 12, Issue 79] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], January 26, 2011
* [https://groups.google.com/d/msg/computer-go-archive/Z5TN-EgqA9Y/fzlJ6MPLp3QJ Re: [Computer-go] Computer-go Digest, Vol 12, Issue 81] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], January 26, 2011
* [https://groups.google.com/d/msg/computer-go-archive/eTKDugZ7Hsk/8TB-C4tPyAcJ [Computer-go] 2nd CFP: DKE Symposium "Driven by Search"] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], May 18, 2011
* [https://groups.google.com/d/msg/computer-go-archive/gq0Fy07fUMg/GxQHc_zOndQJ Re: [Computer-go] Computer-go Digest, Vol 17, Issue 78] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], June 29, 2011
* [https://groups.google.com/d/msg/computer-go-archive/-zdc-ZwEXeA/p11k87TcZDgJ Re: [Computer-go] Computer-go Digest, Vol 18, Issue 29] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], July 11, 2011
=External Links=
* [http://hendrikbaier.jimdo.com/ Hendrik Baier's website]
* [https://project.dke.maastrichtuniversity.nl/games/member_hendrik.htm Hendrik Baier - Games and AI Group]
* [https://scholar.google.de/citations?user=QW-CFsoAAAAJ&hl=en Hendrik Baier - Google Scholar Citations]
=References=
<references />
'''[[People|Up one level]]'''
