2024-06-24T16:50:50Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmhoai:ipsj.ixsq.nii.ac.jp:002162972022-01-30T23:26:36Z00934:00989:10777:10782
Modeling Imperfect Information TANHINMIN with Structural OracleModeling Imperfect Information TANHINMIN with Structural Oracleeng[オリジナル論文] imperfect information game, oracle based algorithm, TANHINMIN, winning strategyhttp://id.nii.ac.jp/1001/00216189/Articlehttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=216297&item_no=1&attribute_id=1&file_no=1Copyright (c) 2022 by the Information Processing Society of JapanFaculty of Economics, Kyushu UniversityDepartment of Mathematical Informatics, Nagoya UniversityHironori, KiyaKatsuki, OhtoHirotaka, OnoTANHINMIN is a simplified and perfect information variant of DAIHINMIN, which is major playing card game in Japan. It can be decided in linear time which player has a winning strategy in 2-player TANHINMIN. This paper is concerned with how we obtain a winning strategy for the imperfect information variant of TANHINMIN. If any information about the opponent player's hand is not given at all, it is obviously difficult or impossible to find a winning strategy, though such a hard situation does not likely happen in real game plays; players usually receive some little information about the opponent player's hand through a game such as the number of cards. To handle the situation that a player can receive some information about the opponent player's hand, we introduce an oracle model in which the oracle provides partial information about the opponent's hand. Interestingly, when players can get partial information of the opponents' hands via oracle, the winning player can find a winning strategy as if it is the (perfect information) TANHINMIN. Furthermore, we show various results about other relationships between the power of oracles and the existence of a computable winning strategy.TANHINMIN is a simplified and perfect information variant of DAIHINMIN, which is major playing card game in Japan. It can be decided in linear time which player has a winning strategy in 2-player TANHINMIN. This paper is concerned with how we obtain a winning strategy for the imperfect information variant of TANHINMIN. If any information about the opponent player's hand is not given at all, it is obviously difficult or impossible to find a winning strategy, though such a hard situation does not likely happen in real game plays; players usually receive some little information about the opponent player's hand through a game such as the number of cards. To handle the situation that a player can receive some information about the opponent player's hand, we introduce an oracle model in which the oracle provides partial information about the opponent's hand. Interestingly, when players can get partial information of the opponents' hands via oracle, the winning player can find a winning strategy as if it is the (perfect information) TANHINMIN. Furthermore, we show various results about other relationships between the power of oracles and the existence of a computable winning strategy.AA11464803情報処理学会論文誌数理モデル化と応用（TOM）15110172022-01-311882-77802022-01-31