Environmental Influence in Bio-inspired Game Level Solver Algorithms

Part of the Studies in Computational Intelligence book series (SCI, volume 511)


Bio-inspired algorithms have been widely used to solve problems in areas like heuristic search, classical optimization, or optimum configuration in complex systems. This paper studies how Genetic Algorithms (GA) and Ant Colony Optimization (ACO) algorithms can be applied to automatically solve levels in the well known Lemmings Game. The main goal of this work is to study the influence that the environment exerts over these algorithms, specially when the goal of the selected game is to save an individual (lemming) that should take into account their environment to improve their possibilities of survival. The experimental evaluations carried out reveals that the performance of the algorithm (i.e. number of paths found) is improve when the algorithm uses a small quantity of information about the environment.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Cormode, 2004]
    Cormode, G.: The hardness of the lemmings game, or oh no, more npcompleteness proofs. In: Proceedings of Third International Conference on Fun with Algorithms, pp. 65–76 (2004)Google Scholar
  2. [Dorigo, 1999]
    Dorigo, M.: Ant colony optimization: A new meta-heuristic. In: Proceedings of the Congress on Evolutionary Computation, pp. 1470–1477. IEEE Press (1999)Google Scholar
  3. [Eiben and Smith, 2009]
    Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer (2009)Google Scholar
  4. [Engelbrecht, 2007]
    Engelbrecht, A.: Computational Intelligence: An Introduction, 2nd edn. Wiley Publishing (2007)Google Scholar
  5. [Farooq, 2008]
    Farooq, M.: Bee-Inspired Protocol Engineering: From Nature to Networks. Springer Publishing Company, Incorporated (2008)Google Scholar
  6. [Fogel, 1995]
    Fogel, D.B.: Evolutionary computation: toward a new philosophy of machine intelligence. IEEE Press (1995)Google Scholar
  7. [Forrest, 1993]
    Forrest, S.: Genetic algorithms: principles of natural selection applied to computation. Science 261(5123), 872–878 (1993)CrossRefGoogle Scholar
  8. [Karaboga, 2005]
    Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Techn. Rep. TR06, vol. 129(2), p. 2865. Erciyes Univ. Press, Erciyes (2005)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Computer Science Department, Escuela Politécnica SuperiorUniversidad Autónoma de MadridMadridSpain

Personalised recommendations