An Upper Bound on the Complexity of Tablut

Publicly Accessible Resources

Abstract

Tablut is a a complete knowledge, deterministic, and asymmetric board game, which has not been solved nor properly studied yet. In this work, firstly its rules and its characteristics are presented, then a study on its complexity is reported. Dividing the state-space of the game into subspaces according to specific conditions, an upper bound to its complexity is eventually found. Since the upper bound seems to be comparable to the one found for Draughts, the open challenge of solving this game seems to require a great computational effort.