loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Hugo Fernandes ; Pedro Nogueira and Eugénio Oliveira

Affiliation: Faculty of Engineering of the University of Porto, Portugal

Keyword(s): Monte Carlo Tree Search (MCTS), Upper Confidence Bounds for Trees (UCT), Monte Carlo Search, Artificial Intelligence (AI), The Octagon Theory.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Bioinformatics ; Biomedical Engineering ; Enterprise Information Systems ; Information Systems Analysis and Specification ; Methodologies and Technologies ; Operational Research ; Simulation ; State Space Search ; Symbolic Systems

Abstract: Monte Carlo Tree Search (MCTS) is a family of algorithms known by its performance in difficult problems that cannot be targeted with the current technology using classical AI approaches. This paper discusses the application of MCTS techniques in the fixed-length game The Octagon Theory, comparing various policies and enhancements with the best known greedy approach and standard Monte Carlo Search. The experiments reveal that the usage of Move Groups, Decisive Moves, Upper Confidence Bounds for Trees (UCT) and Limited Simulation Lengths turn a losing MCTS agent into the best performing one in a domain with estimated gametree complexity of 10293, even when the provided computational budget is kept low.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.221.52.77

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Fernandes, H.; Nogueira, P. and Oliveira, E. (2014). Monte Carlo Tree Search in The Octagon Theory. In Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-015-4; ISSN 2184-433X, SciTePress, pages 328-335. DOI: 10.5220/0004757603280335

@conference{icaart14,
author={Hugo Fernandes. and Pedro Nogueira. and Eugénio Oliveira.},
title={Monte Carlo Tree Search in The Octagon Theory},
booktitle={Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2014},
pages={328-335},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004757603280335},
isbn={978-989-758-015-4},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - Monte Carlo Tree Search in The Octagon Theory
SN - 978-989-758-015-4
IS - 2184-433X
AU - Fernandes, H.
AU - Nogueira, P.
AU - Oliveira, E.
PY - 2014
SP - 328
EP - 335
DO - 10.5220/0004757603280335
PB - SciTePress