OS12-3 Analysis for 4×12 board of Othello

Title:	OS12-3 Analysis for 4×12 board of Othello
Publication:	ICAROB2016
Volume:	21
Pages:	349-352
ISSN:	2188-7829
DOI:	10.5954/ICAROB.2016.OS12-3
Author(s):	Yuki Takeshita, Makoto Sakamoto, Takao Ito, Satoshi Ikeda
Publication Date:	January 29, 2016
Keywords:	combinatorial theory, combinatorial optimization, perfect play, rectangular Othello
Abstract:	More than 20 years has passed since J. Feinstein (1993) found by using computer that perfect play on 6×6 board of Othello gives 16-20 loss for the first player. During this time, computers have improved drastically, however, standard 8×8 board remain unsolved. In our previous paper, we were able to obtain the perfect plays on 6×6 board and 4×10 board. In this paper, we challenge the unsolved problem of 4×12 board by dividing it into about 100 small distinct sub-problems.
PDF File:	https://alife-robotics.co.jp/members2016/icarob/data/papers/OS/OS12-3.pdf
Copyright:	© The authors. This article is distributed under the terms of the Creative Commons Attribution License 4.0, which permits non-commercial use, distribution and reproduction in any medium, provided the original work is properly cited. See for details: https://creativecommons.org/licenses/by-nc/4.0/