Ant colony optimization applied to an autonomous multiagent game

This article shows the implementation of an algo-rithm based on Ant Colony Optimization [Dorigo2001] to produce a multiagent strategy in the game of animats. This game takes place on a grid of MxN squares where animats move according to a given set of rules in order to find as many bombs as possible without exceeding the top movements es-tablished by the game’s difficulty level. It was devel-oped using Delphi ® 2006 for Win32 and we are cur-rently working on a Java version using Multi Objec-tive Genetic Algorithms aiming to make a compari-son of both techniques for these kind of games