DeepAI AI Chat
Log In Sign Up

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

by   Elana Kozak, et al.

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.


Traditional Wisdom and Monte Carlo Tree Search Face-to-Face in the Card Game Scopone

We present the design of a competitive artificial intelligence for Scopo...

AlphaDDA: game artificial intelligence with dynamic difficulty adjustment using AlphaZero

An artificial intelligence (AI) player has obtained superhuman skill for...

Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds

Monte Carlo Tree Search (MCTS), most famously used in game-play artifici...

Lepton Flavour Violation Identification in Tau Decay (τ^-→ μ^-μ^-μ^+) Using Artificial Intelligence

The discovery of neutrino oscillation, proving that neutrinos do have ma...

Developing a Successful Bomberman Agent

In this paper, we study AI approaches to successfully play a 2-4 players...

Development of Rehabilitation System (ReHabgame) through Monte-Carlo Tree Search Algorithm

Computational Intelligence (CI) in computer games plays an important rol...