pith. sign in

arxiv: 2003.13590 · v2 · pith:SKJR2AXVnew · submitted 2020-03-30 · 💻 cs.AI

Suphx: Mastering Mahjong with Deep Reinforcement Learning

classification 💻 cs.AI
keywords mahjonggamegameshumanimperfect-informationmulti-playerplayerssuphx
0
0 comments X
read the original abstract

Artificial Intelligence (AI) has achieved great success in many domains, and game AI is widely regarded as its beachhead since the dawn of AI. In recent years, studies on game AI have gradually evolved from relatively simple environments (e.g., perfect-information games such as Go, chess, shogi or two-player imperfect-information games such as heads-up Texas hold'em) to more complex ones (e.g., multi-player imperfect-information games such as multi-player Texas hold'em and StartCraft II). Mahjong is a popular multi-player imperfect-information game worldwide but very challenging for AI research due to its complex playing/scoring rules and rich hidden information. We design an AI for Mahjong, named Suphx, based on deep reinforcement learning with some newly introduced techniques including global reward prediction, oracle guiding, and run-time policy adaptation. Suphx has demonstrated stronger performance than most top human players in terms of stable rank and is rated above 99.99% of all the officially ranked human players in the Tenhou platform. This is the first time that a computer program outperforms most top human players in Mahjong.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Mahjax: A GPU-Accelerated Mahjong Simulator for Reinforcement Learning in JAX

    cs.AI 2026-05 conditional novelty 5.0

    Mahjax provides a GPU-accelerated JAX implementation of Riichi Mahjong achieving up to 2 million steps per second and enabling effective tabula rasa reinforcement learning.

  2. Self-Play Reinforcement Learning under Imperfect Information in Big 2

    cs.LG 2026-05 unverdicted novelty 3.0

    PPO with moderate entropy regularization and current-policy self-play outperforms Monte Carlo Q, SARSA, and Q-learning in a controlled self-play framework for the imperfect-information game Big 2.