Reference : A Selective Move Generator for the Game Axis and Allies
Scientific congresses and symposiums : Paper published in a journal
Engineering, computing & technology : Computer science
A Selective Move Generator for the Game Axis and Allies
Lupien St-Pierre, David mailto [Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Dép. d'électric., électron. et informat. (Inst.Montefiore) >]
Winands, M.H.M. [> >]
Watt, D.A. [> >]
Computational Intelligence and Games
CIG 2010
August 2010
[en] We consider the move generation in a modern board game where the set of all the possible moves is too large to be generated. The idea is to provide a set of simple abstract tactics that would allow enough combinations to provide strong opposition. The reduced search space is then traversed using the alpha beta search. We also propose a technique that allows us to remove the stochasticity from the search space. The model was tested in a game called Axis and Allies: a modern, turn-based, perfect information, non-deterministic, strategy board game. We first show that a tree search technique based on a restrained set of moves can beat the actual scripted AI engine --- E.Z. Fodder. We can conclude from the experiments that searching deeper generates complex maneuvers which in turn significantly increase the likelihood of victory.

File(s) associated to this reference

Fulltext file(s):

Restricted access
CIG2010.pdfPublisher postprint812.88 kBRequest copy

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.