Computing the Winner of 2-Player TANHINMIN

Hironori KIYA; Katsuki OHTO; Hirotaka ONO

doi:10.1587/transfun.2020DMP0026

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

This article has now been updated. Please use the final version.

Computing the Winner of 2-Player TANHINMIN

Hironori KIYA, Katsuki OHTO, Hirotaka ONO

Author information

Keywords: combinatorial game, winning strategy, bipartite matching

JOURNAL RESTRICTED ACCESS Advance online publication

Article ID: 2020DMP0026

DOI https://doi.org/10.1587/transfun.2020DMP0026

The final version of this article is now available: Vol. E104.A (2021), No. 9 pp. 1134-1141

Details

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.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!