Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

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
Document type :
Journal articles
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Fabien Teytaud Connect in order to contact the contributor
Submitted on : Thursday, December 1, 2016 - 11:40:43 AM
Last modification on : Thursday, November 25, 2021 - 8:22:29 AM
Long-term archiving on: : Monday, March 20, 2017 - 5:25:03 PM


Files produced by the author(s)


  • HAL Id : hal-01406506, version 1



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⟩



Record views


Files downloads