A BFS and A* implementation to the classic 8-puzzle problem
-
Updated
Apr 18, 2018 - C
A BFS and A* implementation to the classic 8-puzzle problem
Classic n-puzzle problem solver using A* search
Using breadth-first-search, depth-first-search, A* algorithm to solve 8-puzzle-problem and missionaries-cannibals-problem
A C-based 8 puzzle solver using graphs and Abstract Data Types and 3 search-algorithms: DFS, BFS, Best-First with Manhattan Distance
A simple 8-puzzle(with GUI) game using iGraphics library.
Resolvedor do jogo 8 Puzzle utilizando backtracking, em C
Add a description, image, and links to the 8-puzzle topic page so that developers can more easily learn about it.
To associate your repository with the 8-puzzle topic, visit your repo's landing page and select "manage topics."