BI-DIRECTIONAL MONTE CARLO TREE SEARCH

BI-DIRECTIONAL MONTE CARLO TREE SEARCH

This paper describes a new algorithm called Bi-Directional Monte Carlo Tree Search. The essential idea of Bi-directional Monte Carlo Tree Search is to run an MCTS forwards from the start state, and simultaneously run an MCTS backwards from the goal state, and stop when the two searches meet. Bi-Dire...

Full description

Bibliographic Details
Main Author: Kristian Spoerer
Format: Article
Language:English
Published: UKM Press 2021-06-01
Series:Asia-Pacific Journal of Information Technology and Multimedia
Subjects:
single agent search
monte carlo tree search
bi-directional search
8-puzzle
pancakes problem
reinforcement learning.
Online Access:https://www.ukm.my/apjitm/view.php?id=199

Internet

https://www.ukm.my/apjitm/view.php?id=199

Similar Items