Relevant bibliographies by topics / Monte Carlo tree search

Contents

  1. Dissertations / Theses

Academic literature on the topic 'Monte Carlo tree search'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Monte Carlo tree search.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Dissertations / Theses on the topic "Monte Carlo tree search"

1

Limér, Christoffer, and Erik Kalmér. "Monte Carlo Tree Search for Risk." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-297695.

Full text
Abstract:
The idea of using artificial intelligence to evaluatemilitary strategies is relevant for a large number of governmentstoday. With programs like AlphaZero beating world championsin games of ever-increasing complexity, military adaptations areprobably not far away, if they are not in use already. Partof these programs’ recent success is due to a heuristic searchalgorithm called Monte Carlo Tree Search. In this project,we explored the possibility of using this algorithm to build aprogram capable of playing the strategy board game of Riskat a high level. The complexity and stochastic dynamic ofthe
APA, Harvard, Vancouver, ISO, and other styles
2

Sista, Subrahmanya Srivathsava. "Adversarial Game Playing Using Monte Carlo Tree Search." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1479820656701076.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Roucairol, Milo. "Monte-Carlo tree search applied to structure generation." Electronic Thesis or Diss., Université Paris sciences et lettres, 2024. http://www.theses.fr/2024UPSLD029.

Full text
Abstract:
Ce document regroupe les article publiés lors de ma thèse dirigée par Tristan Cazenave au LAMSADE. La recherche Monte Carlo désigne une classe d'algorithmes de recherche stochastiques retournant une solution avec une garantie dans le temps, mais sans garantie de résultat. Ces algorithmes utilisent des techniques d'apprentissage par renforcement basées sur des exploration aléatoires ou guidées. Les capacités des algorithmes Monte Carlo sont limitées dans des domaines d'application mis en valeur récemment, comme la génération d'image et de texte, ou les réseaux de neurones, LLM et autres algorit
APA, Harvard, Vancouver, ISO, and other styles
4

Zhou, Jun. "Parallel Go on CUDA with Monte Carlo Tree Search." University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1367942396.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cheng, Chee Chian. "RESOURCE CONSTRAINT COOPERATIVE GAME WITH MONTE CARLO TREE SEARCH." OpenSIUC, 2016. https://opensiuc.lib.siu.edu/dissertations/1239.

Full text
Abstract:
A hybrid methodology of game theory and Monte Carlo Tree Search was developed and the hybrid methodology was tested with various case studies through the nurse scheduling problem to show that it was able to form Pareto front dominance solutions, finding feasible solutions that were optimal and finding feasible partial solutions in over-constrained problems. The performance comparison was carried out with the Genetic Algorithm on the Resident Physician Scheduling problem and showed that the hybrid methodology was able to produce better quality solutions compared to the state of the art approach.
APA, Harvard, Vancouver, ISO, and other styles
6

Bergh, Peter. "Domain independent enhancements to Monte Carlo tree search for eurogames." Thesis, Mittuniversitetet, Institutionen för data- och systemvetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-41251.

Full text
Abstract:
The Monte Carlo tree search-algorithm (MCTS) has been proven successful when applied to combinatorial games, a term applied to sequential games with perfect information. As the focus for MCTS has tended to lean towards combinatorial games, general MCTS-strategies for other types of board games are hard to find. On another front, board games under the name of “Eurogames” have become increasingly popular in the last decade. These games introduce yet another set of challenges for game-playing agents on top of what combinatorial games already offer. Since its initial conception, a large number of
APA, Harvard, Vancouver, ISO, and other styles
7

Rimmel, Arpad. "Improvements and Evaluation of the Monte Carlo Tree Search Algorithm." Paris 11, 2009. http://www.theses.fr/2009PA112223.

Full text
Abstract:
Ma thèse se situe dans le contexte de la planification à horizon fini en environnement discret avec un nombre d'états trop important pour qu'ils soient tous explorés. L'objectif est de maximiser une fonction de récompense qui associe une valeur aux états finaux. Cette thèse est en particulier centrée sur l'amélioration et l'étude d'un nouvel algorithme: l'exploration d'arbre basée sur une formule de bandit avec évaluation Monte Carlo. Après avoir présenté les algorithmes de référence du domaine (Minimax et Alphabéta dans le cas deux joueurs; Nested Monte Carlo et Programmation Dynamique dans l
APA, Harvard, Vancouver, ISO, and other styles
8

Whitehouse, Daniel. "Monte Carlo Tree Search for games with hidden information and uncertainty." Thesis, University of York, 2014. http://etheses.whiterose.ac.uk/8117/.

Full text
Abstract:
Monte Carlo Tree Search (MCTS) is an AI technique that has been successfully applied to many deterministic games of perfect information, leading to large advances in a number of domains, such as Go and General Game Playing. Imperfect information games are less well studied in the field of AI despite being popular and of significant commercial interest, for example in the case of computer and mobile adaptations of turn based board and card games. This is largely because hidden information and uncertainty leads to a large increase in complexity compared to perfect information games. In this thes
APA, Harvard, Vancouver, ISO, and other styles
9

Pacaud, Alexandre. "Bidding efficiently in Simultaneous Ascending Auctions using Monte Carlo Tree Search." Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAT003.

Full text
Abstract:
Depuis son introduction en 1994 aux Etats-Unis, l’enchère ascendante simultanée (SAA) est devenue le mécanisme privilégié pour les enchères du spectre licencié. Avec des investissements dépassant parfois le milliard d’euros, une stratégie d’enchérissement performante devient cruciale pour les opérateurs mobiles. Malgré son importance, il existe un manque de recherche dédiée à la création d’une stratégie d’enchérissement performante dans le cadre du SAA. La complexité intrinsèque du jeu associé à l’enchère SAA rend son analyse ardue pour la théorie des enchères et les méthodes exactes de résolu
APA, Harvard, Vancouver, ISO, and other styles
10

Goh, Say Leng. "An investigation of Monte Carlo tree search and local search for course timetabling problems." Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/43558/.

Full text
Abstract:
The work presented in this thesis focuses on solving course timetabling problems, a variant of education timetabling. Automated timetabling is a popular topic among researchers and practitioners because manual timetable construction is impractical, if not impossible, as it is known to be NP-hard. A two-stage approach is investigated. The first stage involves finding feasible solutions. Monte Carlo Tree Search (MCTS) is utilized in this stage. As far as we are aware, it is used for the first time in addressing the timetabling problem. It is a relatively new search method and has achieved breakt
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Monte Carlo tree search' for particular source types:
Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography