In decision making process for games with perfect information, some well-known techniques, e.g., mini-max algorithms, are useful. However those algorithms are difficult to apply for the games with imperfect information. In this study, the UCT search is applied to make a decision for the Hanafuda game that is a Japanese traditional card game. Hanafuda game is also one of typical games with imperfect information. We attempt to acquire a strategy of this game by using UCT search. Some computational experiments are carried out to verify usefulness of our approach. Obtained experimental results illustrate the effectiveness of UCT search.
