Výsledky vyhledávání - "General Game Playing"

Enhancing Playout Policy Adaptation for General Game Playing

Autor: Mark H. M. Winands, Chiara F. Sironi, Tristan Cazenave

Publikováno v: Monte Carlo Search: MCS 2020, 116-139
STARTPAGE=116;ENDPAGE=139;TITLE=Monte Carlo Search
Communications in Computer and Information Science ISBN: 9783030894528

Playout policy adaptation (ppa) is a state-of-the-art strategy that has been proposed to control the playouts in monte-carlo tree search (mcts). Ppa has been successfully applied to many two-player, sequential-move games. This paper further evaluates

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b24e7e2680dc991fd0a7023ff4b64714
https://doi.org/10.1007/978-3-030-89453-5_9

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Comparing Randomization Strategies for Search-Control Parameters in Monte-Carlo Tree Search

Autor: Mark H. M. Winands, Chiara F. Sironi

Publikováno v: 2019 IEEE Conference on Games (CoG), 1-8
STARTPAGE=1;ENDPAGE=8;TITLE=2019 IEEE Conference on Games (CoG)
CoG

Monte-Carlo Tree Search (MCTS) has been applied successfully in many domains. Previous research has shown that adding randomization to certain components of MCTS might increase the diversification of the search and improve the performance. In a domai

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::001b6ba77c3144d63e65efa8b23a80ac
https://ieeexplore.ieee.org/document/8848056/

Zobrazit plný text záznamu

Deep Reinforcement Learning for General Game Playing

Autor: Adrian Goldwaser, Michael Thielscher

Publikováno v: AAAI

General Game Playing agents are required to play games they have never seen before simply by looking at a formal description of the rules of the game at runtime. Previous successful agents have been based on search with generic heuristics, with almos

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::565a7f5e458f13b29fe8421964286a5b
https://doi.org/10.1609/aaai.v34i02.5533

Zobrazit plný text záznamu

Dissertation/ Thesis

General Game Playing Within Modern TabletopGames Through Rolling Horizon EvolutionaryAlgorithms

Autor: Smedman, Mattias

Tabletop games have within recent years evolvedto become more and more complex, such as through the useof dynamic rules, permanently changing how the game worksafter a playthrough, and players playing different roles in thegame. This leads to unique

Externí odkaz: http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-52865

Zobrazit plný text záznamu

Spatial State-Action Features for General Games

Autor: Dennis J.N.J. Soemers, Éric Piette, Matthew Stephenson, Cameron Browne

Publikováno v: Artificial Intelligence, 321:103937. Elsevier Science
arXiv pre

In many board games and other abstract games, patterns have been used as features that can guide automated game-playing agents. Such patterns or features often represent particular configurations of pieces, empty positions, etc., which may be relevan

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc5d1a5a72d54621531222adbb371904

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Optimised Playout Implementations for the Ludii General Game System

Autor: Dennis J. N. J. Soemers, Éric Piette, Matthew Stephenson, Cameron Browne

Publikováno v: ADVANCES IN COMPUTER GAMES, ACG 2021, 223-234
STARTPAGE=223;ENDPAGE=234;TITLE=ADVANCES IN COMPUTER GAMES, ACG 2021
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Computer Games
Lecture Notes in Computer Science ISBN: 9783031114878
Advances in Computer Games (ACG 2021)

This paper describes three different optimised implementations of playouts, as commonly used by game-playing algorithms such as Monte-Carlo Tree Search. Each of the optimised implementations is applicable only to specific sets of games, based on thei

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81faff30ed52485dba83e4898833777d
http://arxiv.org/abs/2111.02839

Zobrazit plný text záznamu

Self-Adaptive Monte Carlo Tree Search in General Game Playing

Autor: Chiara F. Sironi, Mark H. M. Winands, Jialin Liu

Publikováno v: IEEE Transactions on Games, 12(2), 132-144. IEEE

Many enhancements for Monte Carlo tree search (MCTS) have been applied successfully in general game playing (GGP). MCTS and its enhancements are controlled by multiple parameters that require extensive and time-consuming offline optimization. Moreove

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3b51f783399bdad0160ccfa190b7207
https://cris.maastrichtuniversity.nl/en/publications/dc999e7f-896a-4e4d-bfa6-346ecc8db2fa

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání