Difference between revisions of "Patrick Korus"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Patrick Korus''' '''Patrick Korus''',<br/> a German computer scientist and student at [[Darmstadt University of Technology|TU Darmstadt]...") |
(No difference)
|
Latest revision as of 17:26, 23 May 2021
Patrick Korus,
a German computer scientist and student at TU Darmstadt.
His current research covers Monte-Carlo tree search, which was topic of his B.Sc. thesis [1].
Along with Johannes Czech and Kristian Kersting he worked on an improvement of AlphaZero's MCTS / PUCT algorithm considering transpositions.
The proposed Monte-Carlo Graph Search uses a directed acyclic graph (DAG) rather than a tree structure
and is optionally applied in the deep learning chess variant engine CrazyAra [2].
Selected Publications
- Patrick Korus (2020). An Evaluation of MCTS Methods for Continuous Control Tasks. B.Sc. thesis, TU Darmstadt
- Johannes Czech, Patrick Korus, Kristian Kersting (2020). Monte-Carlo Graph Search for AlphaZero. arXiv:2012.11045
- Johannes Czech, Patrick Korus, Kristian Kersting (2021). Improving AlphaZero Using Monte-Carlo Graph Search. Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, Vol. 31, pdf
External Links
References
- ↑ TU Darmstadt | Johannes Czech | Supervised Theses
- ↑ Johannes Czech, Patrick Korus, Kristian Kersting (2020). Monte-Carlo Graph Search for AlphaZero. arXiv:2012.11045
- ↑ dblp: Patrick Korus
