We am currently working on a project related to computational optimization, in which I have tasked myself with calculating the most efficient solution to one of the game's levels.Link to the flash game: http://trackmill.com/virus-2/The hexagon grid is randomized in color, and the player starts out in one of the corners of the grid. The player selects a color from a short set of predefined colors corresponding to those present in the grid. When the color of the starting hexagon changes by this action, every neighboring hexagon with the same color now also changes, when the player selects a new color. In this fashion, the player must make the entire grid the same color, within a limited number of moves.For simplification, we will use squares instead of hexagons, and use only three colors. The algorithm should be able to calculate order in which we should select colors resulting in a win in the least amount of turns.So far, we are trying to calculate the most efficient solution by way of brute force, testing every single imaginable combination, but how can we do this smarter? Which algorithms can we use / adapt?
Solving virus, a flash game, in the least amount of attempts
optimization;algorithms