Resolution of a Combinatorial Problem using Cultural Algorithms

Abstract

Many problems involve not structured environments which can be solved from the perspective of Bioinspired Algorithms (Cultural Algorithms). In this paper, a proposed algorithm is used to resolve a famous game known as Japanese puzzles, which are analyzed for obtain the optimal solution. The authors show that Japanese Puzzles are constrained combinatorial optimization problems, which can be solved using Cultural Algorithms. Other features, such the use of a belief space involve many proposed solutions and local search heuristics; can also be taught using these puzzles.