Solving Breakthrough for the 6×6 Board

View at publisher Summarise with VIRAT
Authors: Yngvi Björnsson, Kristinn Vikar Jónsson, Dagur Benjamínson, Steinþór Bjarni Steinarsson, Edouard Saussoy, Mark H. M. Winands
Cited by: 0
References: 16

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Breakthrough is a well-known abstract board game played regularly at the Computer Games Olympiad. Despite the straightforward gameplay mechanics of the game, determining optimal play strategies poses significant challenges. We have (weakly) solved a variant of the game played on the 6 × 6 board, representing the largest board instance of the game solved to date. The game is a win for the first player. We apply a hybrid approach of computing endgame tablebases, defining game-specific race patterns, using a family of parallelizable proof-number-based solvers, and training a neural-network-based heuristic job scheduler to construct a solution tree and proof of the game’s game-theoretic value. This approach allowed us to not only solve the 6 × 6 game variant, but also lays the foundation for solving the game’s larger board-size variants.

Fields of Study & Subjects

Artificial Intelligence in Games AI-based Problem Solving and Planning Game Theory and Applications

Publication details

Journal / source
ICGA Journal
Volume
48
Issue
1
Pages
2–15
Publication date
1 February 2026
Language
EN