Reduction of the search space to find perfect play of 6x6 board Othello

被引：0
|
作者：
Takeshita, Yuki [1 ]
Sakamoto, Makoto [2 ]
Ito, Takao [3 ]
Ito, Tsutomu [3 ]
Ikeda, Satoshi [2 ]
机构：
[1] Miyazaki Univ, Grad Sch Engn, Miyazaki, Japan
[2] Miyazaki Univ, Dept Comp Sci & Syst Engn, Miyazaki, Japan
[3] Hiroshima Univ, Grad Sch Engn, Hiroshima, Japan
来源：
ICAROB 2017: PROCEEDINGS OF THE 2017 INTERNATIONAL CONFERENCE ON ARTIFICIAL LIFE AND ROBOTICS | 2017年
关键词：
combinatorial theory; combinatorial optimization; perfect play; miniature Othello;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In 1993, mathematician Feinstein found out perfect play on 6x6 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 6x6 board Othello by searching about nine billion positions.
引用
收藏
页码：P675 / P678
页数：4
相关论文
共 50 条
12345