Complexity analysis and playing strategies for Ludo and its variant race games
- 1 August 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23254270,p. 141-148
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Systematically Incorporating Domain-Specific Knowledge Into Evolutionary Speciated Checkers PlayersIEEE Transactions on Evolutionary Computation, 2005
- Temporal difference learning and TD-GammonCommunications of the ACM, 1995
- Practical issues in temporal difference learningMachine Learning, 1992
- Learning to predict by the methods of temporal differencesMachine Learning, 1988
- Computing a perfect strategy for n × n chess requires time exponential in nJournal of Combinatorial Theory, Series A, 1981
- On the complexity of some two-person perfect-information gamesJournal of Computer and System Sciences, 1978