@inproceedings{oai:ipsj.ixsq.nii.ac.jp:00207650,
 author = {大渡, 勝己 and 木谷, 裕紀 and Katsuki, Ohto and Hironori, Kiya},
 book = {ゲームプログラミングワークショップ2020論文集},
 month = {Nov},
 note = {二人単貧民はトランプゲームの大富豪（大貧民）を簡略化した二人零和確定完全情報ゲームである．通常，単貧民は手札をすべて出し切ったプレイヤの勝ちである．それに対して本研究では勝利条件を一般化し，予め定めた枚数の手札を出した方が勝ち，言い換えると，それぞれ指定された残り手札枚数に先に到達した方が勝ち，というルールについて検証を行った．結果として，通常の単貧民の場合と同じく，必勝プレイヤの判定を手札の総数N に対してO(N) 時間で計算でき，二人単貧民の性質の多くはこの一般化した勝利条件においても成り立つことを示した．さらに，このゲームにおける最適戦略についても，最適な提出札の必要十分な範囲をO(N) 時間で計算できることなどの複数の新しい知見を得た．, Two-player TANHINMIN is a two-player zero-sum perfect information game that is a simplified version of a card game called DAIFUGO or DAIHINMIN. In the original TANHINMIN game, the player who has discarded all his cards in his hand wins in this game. In this paper, we generalize the winning condition as that the player who first discards a predetermined number of cards wins. As a result, we show that the decision of the winning player can be computed in O(N) time when the total number of cards is N as in the usual case of this game, and that many of similar points between original TANHINMIN and this extension. Furthermore, we present several new insights into the optimal strategy in this game, such as the fact that the necessary and sufficient range of optimal discarded cards can be computed in O(N) time.},
 pages = {30--37},
 publisher = {情報処理学会},
 title = {二人単貧民の消費枚数に関する勝利条件の一般化とその解析},
 volume = {2020},
 year = {2020}
}