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. || toc =Rollout Paradigm= In his 2015 AAAI paper //Pruning Game Tree by Rollouts//, 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.
 * Home * People * Bojun Huang**
 * [[image:BojunHuang.jpg width="180" link="https://www.linkedin.com/in/bojun-huang-25453173/"]] ||~ || **Bojun Huang**,
 * Bojun Huang ||~ ||^ ||

=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*

=External Links=
 * [|Bojun Huang | LinkedIn]
 * [|Bojun Huang Inventions, Patents and Patent Applications - Justia Patents Search]

=References= =What links here?= include page="Bojun Huang" component="backlinks" limit="60"
 * Up one Level**