39 citations · 46 across the 5 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.AI2021★ 5 cited
MCTS Based Agents for Multistage Single-Player Card Game
Konrad Godlewski, Bartosz Sawicki
The article presents the use of Monte Carlo Tree Search algorithms for the card game Lord of the Rings. The main challenge was the complexity of the game mechanics, in which each r…
cs.LG2021★ 2 cited
Optimisation of MCTS Player for The Lord of the Rings: The Card Game
Konrad Godlewski, Bartosz Sawicki
The article presents research on the use of Monte-Carlo Tree Search (MCTS) methods to create an artificial player for the popular card game "The Lord of the Rings". The game is cha…
cs.AI2021★ 39 cited
Monte Carlo Tree Search: A Review of Recent Modifications and Applications
Maciej Świechowski, Konrad Godlewski, Bartosz Sawicki +1
Monte Carlo Tree Search (MCTS) is a powerful approach to designing game-playing bots or solving sequential decision problems. The method relies on intelligent tree search that bala…