IMPLEMENTASI MONTE CARLO TREE SEARCH PADA PERMAINAN KARTU “DAIFUGO”

Eunike Thirza Hanitya Christian, R. Gunawan Santoso, Erick Purwanto

Abstract


Daifugo is climbing card game that is originated from Japan. AI player of Daifugo card game can be implemented using Monte Carlo Tree Search to get optimal result from random simulation. Monte Carlo Tree Search has 4 step, selection, expansion, simulation and backpropagation that is executed until maximal loop is reached. Objective of using Monte Carlo Tree Search on AI player in Daifugo card game is to get move with high winning rate and to observe the effect of number of loop on the method to winning rate

Keywords


card game, daifugo, AI, Monte Carlo Tree Search

Full Text:

PDF

References


Adams, Ernest. 2010. Fundamentals of Game Design. United States of America: Pearson.

Bounzy, Bruno. MCTS Experiments on the Voronoi Games. Lipade Universite Paris Descartes, FRANCE

Browne, Cameron. A Survey of Monte Carlo Tree Search Methods. IEEE:2012

Chaslot, Guillaume. Bakkes, Sanders. Szita, Istvan. Spronck, Pieter. Monte Carlo Tree Search: A New Framework For Game AI. Universiteit Maastricht.

Gerrison,G.E.H. 2010. Combining Monte Carlo Tree Search and Opponent Modeling in Poker. Maastricht University

Kozelek, Tomas. 2009. Method of MCTS and the Game Arimaa. Charles University in Prague Faculty of Mathematics and Physics: 2009

Kleij, A. A. J. van der. 2010. Monte Carlo Tree Search and Opponent Modeling Through Player Clustering in No-Limit Texas Hold’em Poker. Netherlands: University of Groningen

Whitehouse, Daniel. Powley, Edward J. Cowling, Peter I. Determinization and Information Set Monte Carlo Tree Search for the Card Game Dou Di Zhu.




DOI: http://dx.doi.org/10.21460/inf.2015.111.424

Refbacks

  • There are currently no refbacks.


Bookmark and Share