Solving Pineapple: An Appplication of Monte-Carlo Tree Search and an Inverstigation of Selection Heuristics

Abstract

In this paper we give a brief survey of Monte Carlo tree search and provide an application of it in solving the game of Open Face Chinese Poker Pineapple. We also describe how effective pruning methods reduce the size of the game tree and performance of the algorithm. Finally, we test the solver against a commercially available AI to evaluate the practical accuracy of our approach.