Bojun Huang
Revision as of 12:22, 27 May 2018 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Bojun Huang''' FILE:BojunHuang.jpg|border|right|thumb|180px|link=https://www.linkedin.com/in/bojun-huang-25453173/| Bojun Huang <ref>I...")
Bojun Huang [1]
Bojun Huang,
a Chinese computer scientist and associate researcher at the System Algorithms Research Group at Microsoft Research, Asia - previously affiliated with the Beihang University, Beijing, China. His research interests span broadly across the theoretical aspects of computer science, including the theory of computation, and computational intelligence, along with computer games and in particular computer Go [2].
Rollout Paradigm
In his 2015 AAAI paper Pruning Game Tree by Rollouts [3], Bojun Huang suggests that two competing search approaches, traditional search techniques such as Alpha-Beta and MT-SSS*, versus the recent Monte-Carlo Tree Search may be unified under the rollout paradigm [4].
Selected Publications
- Bojun Huang (2014). How Computers Play Board Games. (电脑是如何下棋的) Newton Magazine (Chinese)
- Bojun Huang (2014). Sequential Resource Allocation with Positional Costs. arXiv:1404.5428
- Bojun Huang (2015). Pruning Game Tree by Rollouts. AAAI » MCTS, MT-SSS* [6]
External Links
- Bojun Huang | LinkedIn
- Bojun Huang Inventions, Patents and Patent Applications - Justia Patents Search
References
- ↑ Image from Bojun Huang | LinkedIn
- ↑ Bojun Huang | LinkedIn
- ↑ Bojun Huang (2015). Pruning Game Tree by Rollouts. AAAI
- ↑ Hendrik Baier (2017). A Rollout-Based Search Algorithm Unifying MCTS and Alpha-Beta. Computer Games
- ↑ dblp: Bojun Huang
- ↑ Re: Announcing lczero by Daniel Shawul, CCC, January 21, 2018 » LCZero
