Complexity analysis and playing strategies for Ludo and its variant race games

Ludo is a 2-4 player non-deterministic race game with the objective of moving players' pieces through a designated circuit into a winning location, in accordance with die rolls. In this paper we evaluate the state-space complexity of Ludo, and propose and analyze strategies based on four basic moves. We also provide an experimental comparison of pure and mixed versions of these strategies. This research is aimed at enhancing the domain specific knowledge for Ludo and its variant race games, which can then be used for performance improvement in temporal difference learning networks or in evolutionary game analysis for race games.