Computing the winner of 2-player TANHINMIN

Hironori Kiya, Katsuki Ohto, Hirotaka Ono

Research output: Contribution to journalArticlepeer-review

Abstract

DAIHINMIN, which means Grand Pauper, is a popular playing-card game in Japan. TANHINMIN is a simplified variant of DAIHINMIN, which was proposed by Nishino in 2007 in order to investigate the mathematical properties of DAIHINMIN. In this paper, we consider a 2-player generalized TANHINMIN, where the deck size is arbitrary n. We present a linear-time algorithm that determines which player has a winning strategy after all cards are distributed to the players.

Original languageEnglish
Pages (from-to)1134-1141
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE104A
Issue number9
DOIs
Publication statusPublished - 2021
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Computing the winner of 2-player TANHINMIN'. Together they form a unique fingerprint.

Cite this