8-puzzle-solver

★ 63 Open GitHub ↗

Implemented BFS, DFS, A* and IDA* to solve the n-puzzle problem

Explore Similar Repositories

AStar-JPS-ThetaStar : Basic algorithms for single-shot grid-based 2D path finding: BFS, Dijkstra, A*, Jump Point Search (JPS), Theta*
Python-Dijkstra-BFS-A-star : examples of applying Dijkstra, BFS, A* in Pygame
bfstvsr : [CVPR 2025] BF-STVSR: B-Splines and Fourier-Best Friends for High Fidelity Spatial-Temporal Video Super-Resolution
causal-llm-bfs : Efficient Full Causal Graph Discovery Using Large Language Models
instagram-crawling : Code to Crawl Down Instagram data using A BFS from some starting user and also collect MIT popularity score along with every image.
// repository documentation