Computing the Winner of 2-Player TANHINMIN

Computing the Winner of 2-Player TANHINMIN

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2021/09/01, Vol.E104.A(9), pp.1134-1141
Hauptverfasser: KIYA, Hironori, OHTO, Katsuki, ONO, Hirotaka
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
bipartite matching
Card games
combinatorial game
Computer Science
Computer Science, Hardware & Architecture
Computer Science, Information Systems
Engineering
Engineering, Electrical & Electronic
Science & Technology
Technology
winning strategy
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0916-8508
1745-1337
DOI:10.1587/transfun.2020DMP0026