Solving combinatorial puzzles with parallel evolutionary algorithms. Rubik’s cube is the most popular combinatorial puzzle. It is well known that solutions of the combinatorial problems are generally hard to find. If (90^circ) clockwise rotations of the cube’s sides are taken as operations it will give a minimal cube’s grammar. By building formal grammar sentences with the usage of the six operations ([L]eft, [R]ight, [T]op, [D]own, [F]ront, [B]ack) all cube’s permutations can be achieved. In an evolutionary algorithms (like genetic algorithms for example) set of formal grammar sentences can be represented as population individuals. Single cut point crossover can be efficiently applied when population individuals are strings. Changing randomly selected operation with another randomly selected operation can be used as efficient mutation operator. The most important part of such global optimization is the fitness function. For better individuals fitness value evaluation a combination between Euclidean and Hausdorff distances is proposed in this research. The experiments in this research are done as parallel program written in C++ and Open MPI.
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.
- Balabanov, Todor; Ivanov, Stoyan; Ketipov, Rumen: Solving combinatorial puzzles with parallel evolutionary algorithms (2020)