25,161
edits
Changes
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..."
'''[[Main Page|Home]] * [[People]] * Bojun Huang'''
[[FILE:BojunHuang.jpg|border|right|thumb|180px|link=https://www.linkedin.com/in/bojun-huang-25453173/| Bojun Huang <ref>Image from [https://www.linkedin.com/in/bojun-huang-25453173/ Bojun Huang | LinkedIn]</ref> ]]
'''Bojun Huang''',<br/>
a Chinese computer scientist and associate researcher at the System Algorithms Research Group at [[Microsoft]] [https://en.wikipedia.org/wiki/Microsoft_Research Research], Asia - previously affiliated with the [https://en.wikipedia.org/wiki/Beihang_University Beihang University], [https://en.wikipedia.org/wiki/Beijing Beijing], China. His research interests span broadly across the theoretical aspects of computer science, including the [https://en.wikipedia.org/wiki/Theory_of_computation theory of computation], and [https://en.wikipedia.org/wiki/Computational_intelligence computational intelligence], along with computer games and in particular computer [[Go]] <ref>[https://www.linkedin.com/in/bojun-huang-25453173/ Bojun Huang | LinkedIn]</ref>.
<span id="Rollout"></span>
=Rollout Paradigm=
In his 2015 [[AAAI]] paper ''Pruning Game Tree by Rollouts'' <ref>[[Bojun Huang]] ('''2015'''). ''[https://www.semanticscholar.org/paper/Pruning-Game-Tree-by-Rollouts-Huang/a38b358745067f71a9c780db117ae2471e693d63 Pruning Game Tree by Rollouts]''. [[AAAI]]</ref>, Bojun Huang suggests that two competing search approaches, traditional search techniques such as [[Alpha-Beta]] and [[SSS* and Dual*#SSStarandDualStarAsMT|MT-SSS*]], versus the recent [[Monte-Carlo Tree Search]] may be unified under the '''rollout''' paradigm <ref>[[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]</ref>.
=Selected Publications=
<ref>[http://dblp.uni-trier.de/pers/hd/h/Huang:Bojun dblp: Bojun Huang]</ref>
* [[Bojun Huang]] ('''2014'''). ''How Computers Play Board Games''. (电脑是如何下棋的) Newton Magazine (Chinese)
* [[Bojun Huang]] ('''2014'''). ''Sequential Resource Allocation with Positional Costs''. [https://arxiv.org/abs/1404.5428 arXiv:1404.5428]
* [[Bojun Huang]] ('''2015'''). ''[https://www.semanticscholar.org/paper/Pruning-Game-Tree-by-Rollouts-Huang/a38b358745067f71a9c780db117ae2471e693d63 Pruning Game Tree by Rollouts]''. [[AAAI]] » [[Monte-Carlo Tree Search|MCTS]], [[SSS* and Dual*#SSStarandDualStarAsMT|MT-SSS*]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66280&start=67 Re: Announcing lczero] by [[Daniel Shawul]], [[CCC]], January 21, 2018 » [[LCZero]]</ref>
=External Links=
* [https://www.linkedin.com/in/bojun-huang-25453173/ Bojun Huang | LinkedIn]
* [https://patents.justia.com/inventor/bojun-huang Bojun Huang Inventions, Patents and Patent Applications - Justia Patents Search]
=References=
<references />
'''[[People|Up one Level]]'''
[[FILE:BojunHuang.jpg|border|right|thumb|180px|link=https://www.linkedin.com/in/bojun-huang-25453173/| Bojun Huang <ref>Image from [https://www.linkedin.com/in/bojun-huang-25453173/ Bojun Huang | LinkedIn]</ref> ]]
'''Bojun Huang''',<br/>
a Chinese computer scientist and associate researcher at the System Algorithms Research Group at [[Microsoft]] [https://en.wikipedia.org/wiki/Microsoft_Research Research], Asia - previously affiliated with the [https://en.wikipedia.org/wiki/Beihang_University Beihang University], [https://en.wikipedia.org/wiki/Beijing Beijing], China. His research interests span broadly across the theoretical aspects of computer science, including the [https://en.wikipedia.org/wiki/Theory_of_computation theory of computation], and [https://en.wikipedia.org/wiki/Computational_intelligence computational intelligence], along with computer games and in particular computer [[Go]] <ref>[https://www.linkedin.com/in/bojun-huang-25453173/ Bojun Huang | LinkedIn]</ref>.
<span id="Rollout"></span>
=Rollout Paradigm=
In his 2015 [[AAAI]] paper ''Pruning Game Tree by Rollouts'' <ref>[[Bojun Huang]] ('''2015'''). ''[https://www.semanticscholar.org/paper/Pruning-Game-Tree-by-Rollouts-Huang/a38b358745067f71a9c780db117ae2471e693d63 Pruning Game Tree by Rollouts]''. [[AAAI]]</ref>, Bojun Huang suggests that two competing search approaches, traditional search techniques such as [[Alpha-Beta]] and [[SSS* and Dual*#SSStarandDualStarAsMT|MT-SSS*]], versus the recent [[Monte-Carlo Tree Search]] may be unified under the '''rollout''' paradigm <ref>[[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]</ref>.
=Selected Publications=
<ref>[http://dblp.uni-trier.de/pers/hd/h/Huang:Bojun dblp: Bojun Huang]</ref>
* [[Bojun Huang]] ('''2014'''). ''How Computers Play Board Games''. (电脑是如何下棋的) Newton Magazine (Chinese)
* [[Bojun Huang]] ('''2014'''). ''Sequential Resource Allocation with Positional Costs''. [https://arxiv.org/abs/1404.5428 arXiv:1404.5428]
* [[Bojun Huang]] ('''2015'''). ''[https://www.semanticscholar.org/paper/Pruning-Game-Tree-by-Rollouts-Huang/a38b358745067f71a9c780db117ae2471e693d63 Pruning Game Tree by Rollouts]''. [[AAAI]] » [[Monte-Carlo Tree Search|MCTS]], [[SSS* and Dual*#SSStarandDualStarAsMT|MT-SSS*]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66280&start=67 Re: Announcing lczero] by [[Daniel Shawul]], [[CCC]], January 21, 2018 » [[LCZero]]</ref>
=External Links=
* [https://www.linkedin.com/in/bojun-huang-25453173/ Bojun Huang | LinkedIn]
* [https://patents.justia.com/inventor/bojun-huang Bojun Huang Inventions, Patents and Patent Applications - Justia Patents Search]
=References=
<references />
'''[[People|Up one Level]]'''
