Traditional Wisdom and Monte Carlo Tree Search Face-to-Face in the Card Game Scopone

by   Stefano Di Palma, et al.
Politecnico di Milano

We present the design of a competitive artificial intelligence for Scopone, a popular Italian card game. We compare rule-based players using the most established strategies (one for beginners and two for advanced players) against players using Monte Carlo Tree Search (MCTS) and Information Set Monte Carlo Tree Search (ISMCTS) with different reward functions and simulation strategies. MCTS requires complete information about the game state and thus implements a cheating player while ISMCTS can deal with incomplete information and thus implements a fair player. Our results show that, as expected, the cheating MCTS outperforms all the other strategies; ISMCTS is stronger than all the rule-based players implementing well-known and most advanced strategies and it also turns out to be a challenging opponent for human players.


Monte Carlo Methods for the Game Kingdomino

Kingdomino is introduced as an interesting game for studying game playin...

Monte Carlo Tree Search for a single target search game on a 2-D lattice

Monte Carlo Tree Search (MCTS) is a branch of stochastic modeling that u...

Visualising Multiplayer Game Spaces

We compare four different `game-spaces' in terms of their usefulness in ...

Re-determinizing Information Set Monte Carlo Tree Search in Hanabi

This technical report documents the winner of the Computational Intellig...

Development of Rehabilitation System (ReHabgame) through Monte-Carlo Tree Search Algorithm

Computational Intelligence (CI) in computer games plays an important rol...

Better Computer Go Player with Neural Network and Long-term Prediction

Competing with top human players in the ancient game of Go has been a lo...

Monte Carlo Tree Search guided by Symbolic Advice for MDPs

In this paper, we consider the online computation of a strategy that aim...

Please sign up or login with your details

Forgot password? Click here to reset