Amanote Research

Amanote Research

    RegisterSign In

Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-75538-8_7
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2007

Authors
Rémi Coulom
Publisher

Springer Berlin Heidelberg


Related search

Monte Carlo Tree Search in Hex

IEEE Transactions on Computational Intelligence and AI in Games
ControlSystems EngineeringElectronic EngineeringElectricalArtificial IntelligenceSoftware
2010English

Score Bounded Monte-Carlo Tree Search

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Monte-Carlo Tree Search and Minimax Hybrids

2013English

A Parallel Monte-Carlo Tree Search Algorithm

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Efficient Monte Carlo Decision Tree Solution in Dynamic Purchasing Environments

2003English

Pareto Monte Carlo Tree Search for Multi-Objective Informative Planning

2019English

Parallel Nested Monte-Carlo Search

2009English

An Entropy-Guided Monte Carlo Tree Search Approach for Generating Optimal Container Loading Layouts

Entropy
Electronic EngineeringInformation SystemsMathematical PhysicsElectricalAstronomyPhysics
2018English

Graph-Based Genetic Algorithm and Generative Model/Monte Carlo Tree Search for the Exploration of Chemical Space

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy