Winning strategies of multimove games on some Asian chess games

Let ???? and ???? be positive integers. An (????, ???? ) multimove game is a two-player game in which the first player (White/female) has ???? moves per turn, and the second player (Black/male) has ???? moves per turn. In this dissertation, we present a winning strategy for an (????, ???? ) multimove game on Thai chess, Japanese chess, Chinese chess, and Korean chess for all (????, ???? ) not equal to (1, 1) or (2, 2). Moreover, we demonstrate that Black does not have a winning strategy in a (2,2) multimove game in Thai, Japanese, Chinese, and Korean chess games.