Subangkar/N-Puzzle-Problem-CPP-Implementation-using-A-Star-Search
A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts
This tool helps computer science students and AI enthusiasts explore and compare different search algorithms for solving the classic N-puzzle game. You input a jumbled puzzle board, and it outputs the optimal sequence of moves to solve it, along with the performance of various heuristic methods. It's designed for those studying or teaching artificial intelligence and algorithm design.
No commits in the last 6 months.
Use this if you are studying AI search algorithms and want to see how different heuristics (Hamming, Manhattan, Linear Conflict) impact the solution of N-puzzle problems.
Not ideal if you're looking for a general-purpose puzzle solver for a wide variety of games beyond the N-puzzle, or if you need solutions for very large boards using the Hamming distance heuristic due to high memory requirements.
Stars
10
Forks
4
Language
C++
License
—
Category
Last pushed
Dec 03, 2018
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/Subangkar/N-Puzzle-Problem-CPP-Implementation-using-A-Star-Search"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
YashIndane/webcube
Rubik's cube assistant on Flask webapp
mahdavipanah/pynpuzzle
Solve, test and benchmark algorithms for N-Puzzle problem with Python
huyvohcmc/8-puzzle
Java program to solve the 8 puzzle problem using branch and bound algorithm.
kyo-takano/alphacube
A powerful & flexible Rubik's Cube solver
NiloofarShahbaz/8-puzzle-search-implementation
this a python BFS , A* and RBFS implementation of 8 puzzle