English

Quixo Is Solved

Computer Science and Game Theory 2020-08-03 v1

Abstract

Quixo is a two-player game played on a 5×\times5 grid where the players try to align five identical symbols. Specifics of the game require the usage of novel techniques. Using a combination of value iteration and backward induction, we propose the first complete analysis of the game. We describe memory-efficient data structures and algorithmic optimizations that make the game solvable within reasonable time and space constraints. Our main conclusion is that Quixo is a Draw game. The paper also contains the analysis of smaller boards and presents some interesting states extracted from our computations.

Cite

@article{arxiv.2007.15895,
  title  = {Quixo Is Solved},
  author = {Satoshi Tanaka and François Bonnet and Sébastien Tixeuil and Yasumasa Tamura},
  journal= {arXiv preprint arXiv:2007.15895},
  year   = {2020}
}

Comments

19 pages

R2 v1 2026-06-23T17:32:56.333Z