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 . 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 .
- 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