A game informatical analysis of RoShamBo

This paper introduces a family of RoShamBo games, denoted by RSB(n,b,s,r) which means that n players simultaneously show a move among b possible moves with possible s winning regulations, at each round out of r round matches in total. The player who wins more after r rounds wins. A game informatical analysis of RSB(n,b,s,r) using game refinement measure is carried out, while experiments have been conducted by developing computer players and simulating a million RoShamBo games. Results show that RSB(n, 3, 1, 1) is best to play with n = 8 or 9 and RSB(2, 3, 1,r) is best to play with r = 9 or 10. Moreover, it is confirmed that popular RoShamBo-based games such as GuRiKo in Japan and King PaoYingShub in Thailand have been played with reasonable settings.