Computing the Winner of 2-Player TANHINMIN

Hironori KIYA; Katsuki OHTO; Hirotaka ONO

doi:10.1587/transfun.2020DMP0026

Computing the Winner of 2-Player TANHINMIN

Hironori KIYA, Katsuki OHTO, Hirotaka ONO

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E104-A No.9 pp.1134-1141

Publication Date: 2021/09/01

Publicized: 2021/02/10

Online ISSN: 1745-1337

DOI: 10.1587/transfun.2020DMP0026

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category: Algorithms and Data Structures

Authors

Hironori KIYA
  Nagoya University
Katsuki OHTO
  Nagoya University
Hirotaka ONO
  Nagoya University

Keyword

combinatorial game, winning strategy, bipartite matching

Cite this

Copy

Hironori KIYA, Katsuki OHTO, Hirotaka ONO, "Computing the Winner of 2-Player TANHINMIN" in IEICE TRANSACTIONS on Fundamentals, vol. E104-A, no. 9, pp. 1134-1141, September 2021, doi: 10.1587/transfun.2020DMP0026.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020DMP0026/_p

Copy

@ARTICLE{e104-a_9_1134,
author={Hironori KIYA, Katsuki OHTO, Hirotaka ONO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computing the Winner of 2-Player TANHINMIN},
year={2021},
volume={E104-A},
number={9},
pages={1134-1141},
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.},
keywords={},
doi={10.1587/transfun.2020DMP0026},
ISSN={1745-1337},
month={September},}

Copy

TY - JOUR
TI - Computing the Winner of 2-Player TANHINMIN
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1134
EP - 1141
AU - Hironori KIYA
AU - Katsuki OHTO
AU - Hirotaka ONO
PY - 2021
DO - 10.1587/transfun.2020DMP0026
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2021
AB - 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.
ER -