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 sliding puzzle game and solver using ncurses.
Classic sliding puzzle game programmed in C++11. This program works on both Microsoft Windows and on Linux. 🧩
A fun, cross-platform, slidy-tile game written with C++ 17!
Comparison of BFS, DFID, A* and IDA* algorithms on the 15-Puzzle Problem.
A C++ project which efficiently solves any given N-puzzle using backtracking on a decision tree.
15 puzzle and its variants from 8 to 99
Solving N Puzzle problem using A* algorithm
Watch in real time how an AI solve the famous 15 Puzzle
Sliding-puzzle Games FRAMEWORK . Are proposed exemples of : 2048 , SOKOBAN , TAKIN
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.
🧩 The classic 15 Puzzle in your terminal window
Play the 15 Puzzle game!
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."