A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts
-
Updated
Dec 3, 2018 - C++
A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts
A C++ project which efficiently solves any given N-puzzle using backtracking on a decision tree.
Classic sliding puzzle game programmed in C++11. This program works on both Microsoft Windows and on Linux. 🧩
A sliding puzzle game and solver using ncurses.
A fun, cross-platform, slidy-tile game written with C++ 17!
Comparison of BFS, DFID, A* and IDA* algorithms on the 15-Puzzle Problem.
Sliding-puzzle Games FRAMEWORK . Are proposed exemples of : 2048 , SOKOBAN , TAKIN
Solving N Puzzle problem using A* algorithm
Watch in real time how an AI solve the famous 15 Puzzle
A sliding puzzle game based on c++
WINAPI, GDI, C++ implementation of the "15" puzzle in an event-driven style with functional layers. This is an old project upload.
The 15 Puzzle is a sliding puzzle that consists of a 4 by 4 frame of numbered square tiles in an arbitrary ordering with one space. The objective of the puzzle is to place the tiles in ascending order, by making sliding moves that use the empty space.
Add a description, image, and links to the 15-puzzle topic page so that developers can more easily learn about it.
To associate your repository with the 15-puzzle topic, visit your repo's landing page and select "manage topics."