Monte-Carlo Tree Search For The "Mr Jack" Board Game

, , and . International Journal on Soft Computing, Artificial Intelligence and Applications (IJSCAI) 4 (1): 14 (February 2015)


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.

Links and resources

BibTeX key:
search on:

Comments and Reviews  

There is no review or comment yet. You can write one!


Cite this publication