TY - GEN
T1 - Complexity analysis and playing strategies for Ludo and its variant race games
AU - Alvi, Faisal
AU - Ahmed, Moataz
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/80054048142
U2 - 10.1109/CIG.2011.6031999
DO - 10.1109/CIG.2011.6031999
M3 - Conference contribution
AN - SCOPUS:80054048142
SN - 9781457700095
T3 - 2011 IEEE Conference on Computational Intelligence and Games, CIG 2011
SP - 134
EP - 141
BT - 2011 IEEE Conference on Computational Intelligence and Games, CIG 2011
ER -