Monte-Carlo Tree Search for the “Mr Jack” Board Game - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal on Soft Computing, Artificial Intelligence and Applications (IJSCAI) Year : 2015

Monte-Carlo Tree Search for the “Mr Jack” Board Game

Abstract

Recently the use of the Monte-Carlo Tree Search algorithm, and in particular its most famous implementation, the Upper Confidence Tree can be seen has a key moment for artificial intelligence in games. This family of algorithms provides huge improvements in numerous games, such as Go, Havannah, Hex or Amazon. In this paper we study the use of this algorithm on the game of Mr Jack and in particular how to deal with a specific decision-making process. Mr Jack is a 2-player game, from the family of board games. We will present the difficulties of designing an artificial intelligence for this kind of games, and we show that Monte-Carlo Tree Search is robust enough to be competitive in this game with a smart approach
Fichier principal
Vignette du fichier
MrJack.pdf (963.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01406506 , version 1 (01-12-2016)

Identifiers

  • HAL Id : hal-01406506 , version 1

Cite

Ahmad Mazyad, Fabien Teytaud, Cyril Fonlupt. Monte-Carlo Tree Search for the “Mr Jack” Board Game. International Journal on Soft Computing, Artificial Intelligence and Applications (IJSCAI), 2015. ⟨hal-01406506⟩
159 View
249 Download

Share

Gmail Facebook X LinkedIn More