OS21-3 Reduction of the search space to find perfect play of 6×6 board Othello

Title:	OS21-3 Reduction of the search space to find perfect play of 6×6 board Othello
Publication:	ICAROB2017
Volume:	22
Pages:	675-678
ISSN:	2188-7829
DOI:	10.5954/ICAROB.2017.OS21-3
Author(s):	Yuki Takeshita, Makoto Sakamoto, Takao Ito, Tsutomu Ito, Satoshi Ikeda
Publication Date:	January 19, 2017
Keywords:	combinatorial theory, combinatorial optimization, perfect play, miniature Othello
Abstract:	In 1993, mathematician Feinstein found out perfect play on 6×6 board Othello gives 16-20 loss for the first player by using computer. He reported on the Web that it took two weeks to search forty billion positions in order to obtain the result. In our previous papers, we confirmed the perfect play he found is correct. And we also found another perfect play different from the one he found to search 884 billion positions. In order to search efficiently, we attempted to reduce the search space to find some perfect play. In this paper, we introduce some techniques to solve 6×6 board Othello by searching about nine billion positions.
PDF File:	https://alife-robotics.co.jp/members2017/icarob/data/html/data/OS_pdf/OS21/OS21-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/