Satoshi Ikeda¹, Tomoyasu Toshimori², Makoto Sakamoto¹, Takao Ito^3
1Department of Computer Science and System Engineering, Miyazaki University, Japan
²Graduate School of Engineering, Miyazaki University, Japan
³Graduate School of Engineering, Hiroshima University, Japan
pp. 331–336
ABSTRACT
In 1993, Joel Feinstein found one of perfect plays for Othello (Reversi) with board size of 2n×2n (n = 2,3) , which showed that the second player(White) is the winner, respectively. We have been analyzing Othello with a board size of 4×2n (n = 3,4,…) since 2015. As results, we found one of perfect plays for each on the 4×2n (n = 3,4,5) boards, which showed that the first player (Black) is the winner, respectively. Recently, we have finished the analysis of the 4×12 board. In this paper, we will introduce the analysis results of 4×12 board Othello and summarize the results that have been found so far.

ARTICLE INFO
Article History
Received 25 November 2021
Accepted 10 October 2022

Keywords
Combinatorial game theory
Perfect information
Perfect play
Othello (Reversi)

JRNAL9405

Download article (PDF)