On Using Monte-Carlo Tree Search to Solve Puzzles-Reference-Cited by-同舟云学术

On Using Monte-Carlo Tree Search to Solve Puzzles

Published:2021-07-13 Issue: Volume: Page:
ISSN:
Container-title:2021 7th International Conference on Computer Technology Applications
language:
Short-container-title:

Author:

Kiarostami Mohammad Sina¹,Daneshvaramoli Mohammadreza²,Khalaj Monfared Saleh²,Visuri Aku¹,Karisani Helia²,Hosio Simo¹,Khashehchi Hamed³,Futuhi Ehsan³,Rahmati Dara³,Gorgin Saeid³

Affiliation:

1. University of Oulu, Finland

2. Institute for Research in Fundamental Sciences(IPM), Iran

3. Institute for Research in Fundamental Sciences (IPM), Iran

Funder

Academy of Finland

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3477911.3477915

Reference34 articles.

1. Ahmed Abdelkader Aditya Acharya and Philip Dasler. 2015. 2048 is NP-Complete. Ahmed Abdelkader Aditya Acharya and Philip Dasler. 2015. 2048 is NP-Complete.

2. H Baier and Mark Winands. 2012. Nested Monte-Carlo Tree Search for online planning in large MDPs. Frontiers in Artificial Intelligence and Applications 109–114. https://doi.org/10.3233/978-1-61499-098-7-109 H Baier and Mark Winands. 2012. Nested Monte-Carlo Tree Search for online planning in large MDPs. Frontiers in Artificial Intelligence and Applications 109–114. https://doi.org/10.3233/978-1-61499-098-7-109

3. MCTS-minimax hybrids;Baier Hendrik;IEEE Transactions on Computational Intelligence and AI in Games,2014

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal pivot path of the simplex method for linear programming based on reinforcement learning;Science China Mathematics;2024-02-29

2. A solver of single-agent stochastic puzzle: A case study with Minesweeper;Knowledge-Based Systems;2022-06

3. A Study on Non-overlapping Multi-agent Pathfinding;Lecture Notes in Networks and Systems;2022