Solving the light up with Ant Colony Optimization

A number of single-player games have been proven to be computationally difficult, including the Light Up. Although, recently, such single-player games have received considerable attention from the scientific community, only a few papers address the Light Up. This paper presents a two phase Ant Colony Optimization algorithm to solve this puzzle. In the first phase, logical rules are applied to the game grid in order to restrict the space searched by the algorithm in the second phase. The approach was applied to thirty-two game instances with grids ranging from 7×7 to 40×30 solving them efficiently.

[1]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[2]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[3]  Sancho Salcedo-Sanz,et al.  A hybrid hopfield network-genetic algorithm approach for the lights-up puzzle , 2007, 2007 IEEE Congress on Evolutionary Computation.

[4]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[5]  Christine Solnon,et al.  Ants can solve constraint satisfaction problems , 2002, IEEE Trans. Evol. Comput..

[6]  Christian Blum,et al.  ACO for Maximal Constraint Satisfaction Problems , 2001 .

[7]  Jano I. van Hemert,et al.  A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems , 2004, EvoCOP.

[8]  Graham Kendall,et al.  A Survey of NP-Complete Puzzles , 2008, J. Int. Comput. Games Assoc..

[9]  Michael Sampels,et al.  A MAX-MIN Ant System for the University Course Timetabling Problem , 2002, Ant Algorithms.

[10]  Christine Solnon,et al.  A Study of Greedy, Local Search, and Ant Colony Optimization Approaches for Car Sequencing Problems , 2003, EvoWorkshops.

[11]  Patrick Albert,et al.  Integration of ACO in a Constraint Programming Language , 2008, ANTS Conference.

[12]  Sancho Salcedo-Sanz,et al.  On the performance of the LP-guided Hopfield network-genetic algorithm , 2009, Comput. Oper. Res..

[13]  Christine Solnon.  Boosting ACO with a Preprocessing Step , 2002, EvoWorkshops.

[14]  Sancho Salcedo-Sanz,et al.  Using a bank of binary Hopfield networks as constraints solver in hybrid algorithms , 2008, Neurocomputing.

[15]  Xin Yao,et al.  Improving the performance of evolutionary algorithms in grid-based puzzles resolution , 2009, Evol. Intell..

[16]  Marc Gravel,et al.  Review and comparison of three methods for the solution of the car sequencing problem , 2005, J. Oper. Res. Soc..