TITLE:
A Fundamental Study of a Computer Player Giving Fun to the Opponent
AUTHORS:
Yuki Takaoka, Takashi Kawakami, Ryosuke Ooe
KEYWORDS:
Giving Fun, Imperfect Information Game, UCB Applied to Tree
JOURNAL NAME:
Journal of Computer and Communications,
Vol.6 No.1,
December
29,
2017
ABSTRACT:
In this research, we aim to create a computer player that gives fun to the opponent. Research on game AI has spread widely in recent years, and many games are being studied. Some of those studies have made remarkable results. Game research is aimed at strengthening computer players. However, it is unknown whether a computer player who is too strong is good. There may also be opponents who think that a computer player is not interesting if it is too strong. Therefore, we thought whether we could create a computer player who entertains the opponent while maintaining a certain degree of strength. To realize this idea, we use the Monte Carlo Tree Search. We tried to create a computer player that gives fun to the opponent by improving the Monte Carlo Tree Search. As a result of some experiments, we succeeded in giving fun, although it was a first step. On the other hand, many problems were found through experiments. In future, it is necessary to solve these problems.