SOLUTION FOR RUBIK’S CUBE BY USING GENETIC ALGORITHM

Solutions calculated by Genetic Algorithms have come to surpass exact methods for solving various problems. The Rubik’s Cube optimization problem is one such area. In this work we present a different approach to solve the Rubik’s Cube with a low Number of moves by building upon the genetic algorithm approach. We provide a group theoretic analysis of the sub problem complexity induced by genetic algorithm approach, transitions and design a Genetic Algorithm from the ground up including detailed derivation of our custom Fitness functions. By using this genetic algorithm approach we can find optimized solution any problem, especially for NP-Hard problem we need to find a robust and optimized solution, Rubik’s Cube is also one of the such type of problem, Hence in this paper our focus is to carry various experiment by using Rubik’s Cube and to find the number of minimum moves in which we can solve this problem, The experiments will carry by using Rubik’s Cube physically or by simulation, After getting Optimized solution paper will talk about results and conclusion that whether we got an optimized solution for this problem or not.