N Puzzle Program that solves any Size of Puzzle if Solvable using A* Search and Heuristics (Manhatten Distance and Hamming Distance) The Program Solves both Simple and Large Puzzles and Returns The Execution Time and Number of Moves and Detects The Solvable and Non Solvable Puzzles.