An Upper Bound on the Complexity of Tablut

TL;DR

This paper analyzes the game Tablut, presenting its rules, and establishes an upper bound on its complexity by dividing its state space, indicating that solving it would require significant computational resources.

Contribution

It provides the first complexity analysis of Tablut and derives an upper bound on its state space, comparing it to Draughts.

Findings

Upper bound on Tablut's complexity established

State space divided into subspaces based on specific conditions

Complexity comparable to Draughts, implying high computational effort

Abstract

Tablut is a complete-knowledge, deterministic, and asymmetric board game, which has not been solved nor properly studied yet. In this work, its rules and characteristics are presented, then a study on its complexity is reported. An upper bound to its complexity is found eventually by dividing the state-space of the game into subspaces according to specific conditions. This upper bound is comparable to the one found for Draughts, therefore, it would seem that the open challenge of solving this game requires a considerable computational effort.