Genetic based Algorithm for N - Puzzle Problem

Abstract

N – Puzzle problem is an important problem in mathematics and has implications in Artificial Intelligence especially in gaming. The work presented reviews the previous attempts to solve this problem. A formal definition of the problem has been presented. The reason why it is considered as NP hard problem and why Genetic Algorithms (GAs) is applied has been explained. The work here by presents a GAs based algorithm to solve N – Puzzle problem. The algorithm has been analyzed and it is a sturdy belief that the presented algorithm has complexity better than most of the works studied. The work is a part of larger endeavor to solve all NP Hard problems by GAs.