Survey of Artificial Intelligence for Card Games and Its Application to the Swiss Game Jass (2019-06-01T00:00:00.000000Z)

TL;DR

This work provides an overview of the current state-of-the-art of Artificial Intelligence methods for card games in general and their application to the use-case of the Swiss card game Jass.

Abstract

In the last decades we have witnessed the success of applications of Artificial Intelligence to playing games. In this work we address the challenging field of games with hidden information and card games in particular. Jass is a very popular card game in Switzerland and is closely connected with Swiss culture. To the best of our knowledge, performances of Artificial Intelligence agents in the game of Jass do not outperform top players yet. Our contribution to the community is two-fold. First, we provide an overview of the current state-of-the-art of Artificial Intelligence methods for card games in general. Second, we discuss their application to the use-case of the Swiss card game Jass. This paper aims to be an entry point for both seasoned researchers and new practitioners who want to join in the Jass challenge.

Authors

Joel Niklaus

4 papers

M. Liwicki

10 papers

Michele Alberti

2 papers

TL;DR

Abstract

Authors

References54 items

Artificial Intelligence and Games

Improving Search with Supervised Learning in Trick-Based Card Games

Deep Counterfactual Regret Minimization

Solving Large Sequential Games with the Excessive Gap Technique

Solving Imperfect-Information Games via Discounted Regret Minimization

Application of Self-Play Reinforcement Learning to a Four-Player Game of Imperfect Information

Improving Hearthstone AI by Combining MCTS and Supervised Learning Algorithms

Time and Space: Why Imperfect Information Games are Hard

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

Superhuman AI for heads-up no-limit poker: Libratus beats top professionals

Neural Fictitious Self-Play in Imperfect Information Games with Many Players

Monte Carlo tree search experiments in hearthstone

Proximal Policy Optimization Algorithms

Evaluating and modelling Hanabi-playing agents

DeepStack: Expert-level artificial intelligence in heads-up no-limit poker

Aspects of the Cooperative Card Game Hanabi

Combining Gameplay Data with Monte Carlo Tree Search to Emulate Human Play

Deep Reinforcement Learning from Self-Play in Imperfect-Information Games

Convergence and correctness analysis of Monte-Carlo tree search algorithms: A case study of 2 by 4 Chinese dark chess

Building a computer Mahjong player based on Monte Carlo simulation and opponent models

A Doppelkopf Player Based on UCT

Player Preference and Style in a Leading Mobile Card Game

Smooth UCT Search in Computer Poker

Online Monte Carlo Counterfactual Regret Minimization for Search in Imperfect Information Games

Solving Hanabi: Estimating Hands by Opponent's Actions in Cooperative Game with Incomplete Information

Heads-up limit hold’em poker is solved

Monte-Carlo Tree Search for the Game of "7 Wonders"

Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games

Using Response Functions to Measure Strategy Strength

Integrating Monte Carlo Tree Search with Knowledge-Based Methods to Create Engaging Play in a Commercial Mobile Game

Ensemble Determinization in Monte Carlo Tree Search for the Imperfect Information Card Game Magic: The Gathering

Evolving card sets towards balancing dominion

A Survey of Monte Carlo Tree Search Methods

Determinization and information set Monte Carlo Tree Search for the card game Dou Di Zhu

Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling

GIB: Imperfect Information in a Computationally Challenging Game

Computer poker: A review

Monte Carlo Sampling for Regret Minimization in Extensive Games

Lower Bounding Klondike Solitaire with Monte-Carlo Planning

Monte Carlo search applied to card selection in Magic: The Gathering

AN ANALYSIS OF UCT IN MULTI-PLAYER GAMES

Regret Minimization in Games with Incomplete Information

Bandit Based Monte-Carlo Planning

A Skat Player Based on Monte-Carlo Simulation

Feature Construction for Reinforcement Learning in Hearts

Solitaire: Man Versus Machine

Challenging Human Supremacy in Skat – Guided and Complete And-Or Belief-Space Tree Search for Solving the Nullspiel

Comparing UCT versus CFR in Simultaneous Games

Non-Cooperative Games

Finding Robust Texas Hold'em Poker Strategies Using Pareto Coevolution and Deterministic Crowding

Reinforcement Learning: An Introduction

played in East and South East Asia

discussed in the paper (in order of appearance)

card game played by two or more players. 7 Wonders is a board game with strong elements of card games including hidden information for two to seven players

Field of Study

Journal Information

Name

Page

Venue Information

Name

Type

URL

Alternate Names