paper-with-me

Papers

Monte Carlo Tree Search for a single target search game on a 2-D lattice

2020-11-29 · Elana Kozak, Scott Hottovy

Monte Carlo Tree Search (MCTS) is a branch of stochastic modeling that utilizes decision trees for optimization, mostly applied to artificial intelligence (AI) game players. This project imagines a game in which an AI player searches for a stationary target within a 2-D lattice. We analyze its behavior with different target distributions and compare its efficiency to the Levy Flight Search, a model for animal foraging behavior. In addition to simulated data analysis we prove two theorems about the convergence of MCTS when computation constraints neglected.

📄 PDF Abstract BibTeX arXiv:2011.14246

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Monte Carlo Search Algorithms Discovering Monte Carlo Tree Search Exploration Terms

2024-04-14 · Tristan Cazenave

Monte Carlo Tree Search and Monte Carlo Search have good results for many combinatorial problems. In this paper we propose to use Monte Carlo Search to design mathematical expressions that are used as exploration terms f…

Is Monte Carlo Tree Search Just Every-Visit Monte Carlo Control?

2026-08-28 · Xianyi Wu arxiv

Monte Carlo Tree Search (MCTS) and every-visit Monte Carlo (MC) control are usually presented as different methods. MCTS is described in the language of search (selection, expansion, simulation, and backup), whereas MC c…

Reinforcement Learning

Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search

2020-05-14 · Jack Reinhardt

Advances in intelligent game playing agents have led to successes in perfect information games like Go and imperfect information games like Poker. The Information Set Monte Carlo Tree Search (ISMCTS) family of algorithms…

Multi-Turn Target-Guided Topic Prediction with Monte Carlo Tree Search

2021-12-01 · ICON 2021 12 · Jingxuan Yang, Si Li, Jun Guo

This paper concerns the problem of topic prediction in target-guided conversation, which requires the system to proactively and naturally guide the topic thread of the conversation, ending up with achieving a designated …

PredictionRetrieval

Variance Reduction in Monte-Carlo Tree Search

2011-12-01 · NeurIPS 2011 12 · Joel Veness, Marc Lanctot, Michael Bowling

Monte-Carlo Tree Search (MCTS) has proven to be a powerful, generic planning technique for decision-making in single-agent and adversarial environments. The stochastic nature of the Monte-Carlo simulations introduces err…

Decision Making