This repository is a sliding puzzle solver using heuristic algorithms.
Heuristics used the manhattan_distance, row column conflict, and hamming_distance methods based on A*.
git clone https://github.com/poiu694/SlidingPuzzle30.git
cd SlidingPuzzle30
g++ -std=c++17 main.cpp
./a.out
You can change puzzle value with variable puzzle.
Horizontal and vertical lengths can also be converted with ROW, COLUMN CONSTANT.