Othello is Solved

Hiroki Takizawa
10/30/2023
cs.AI

No official code found. Best implementation: eukaryo/reversi-scripts (42 stars, GPL-3.0, last commit 2023-11-16).

Abstract

The game of Othello is one of the world's most complex and popular games that has yet to be computationally solved. Othello has roughly ten octodecillion (10 to the 58th power) possible game records and ten octillion (10 to the 28th power) possible game positions. The challenge of solving Othello, determining the outcome of a game with no mistake made by either player, has long been a grand challenge in computer science. This paper announces a significant milestone: Othello is now solved. It is computationally proved that perfect play by both players lead to a draw. Strong Othello software has long been built using heuristically designed search techniques. Solving a game provides a solution that enables the software to play the game perfectly.

View on arXivView PDF

Code Implementations(1)

GPL-3.0
422C++, ShellOct 23, 20232 years agoGPL-3.0

Similar Papers

Cite this paper

@article{takizawa2023othello,
  title  = {Othello is Solved},
  author = {Hiroki Takizawa},
  year   = {2023},
  eprint = {2310.19387},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.19387v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.19387.svg)](https://codeofpaper.com/paper/2310.19387)

Discussion