INTEGER PROGRAMMING FORMULATIONS FOR GENARATING AND SOLVING SURVO PUZZLE

Puzzles are often generated for entertainment but they are also mathematical or logical problems. Every puzzle has its own logic and mathematics. Puzzles become more understandable when we can grasp and model the underlying logic. For this reason, puzzles constitute a research area of interest to scientists. In this paper, the logic-based puzzle Survo is analyzed. We have formulated two integer linear programming models. The first model is to generate Survo puzzles. The second model is to solve Survo puzzles. First, the effectiveness of the second model has been tested by solving Survo puzzles available on the internet. The solutions are obtained in short cpu times. Then, the effectiveness of the models are analyzed using experimental computations. The computational results are obtained and analyzed on a number of Survo puzzle instances. The first proposed mathematical model is generated puzzles up to 50*50 size in short cpu times, maximum 254 seconds. Puzzles up to size 15*15 are solved with the second proposed model.