Solving 8-puzzle with BFS and DFS algorithms
-
Updated
Dec 28, 2023 - C++
Solving 8-puzzle with BFS and DFS algorithms
This repository contains generic platform for solving and benchmarking computational puzzles using different search strategies
Solver for the 8-puzzle problem using the following algorithms: BestFS (using Manhattan's distance as a heuristic function) , DFS and BFS.
This is an Artificial Intelligence project which solves the 8-Puzzle problem using different Artificial Intelligence algorithms techniques like Uninformed-BFS, Uninformed-Iterative Deepening, Informed-Greedy Best First, Informed-A* and Beyond Classical search-Steepest hill climbing.
This is the artificial intelligence problem solving project. This work has been done during the course of Artificial Intelligence in my bachelors degree. There are three problems in this project; United Federation of Planets (UFP), Raju’s Patterns and 8-Puzzle which have been solved through AI algorithms.
Basic 8-puzzle solver using A* search
Add a description, image, and links to the 8-puzzle-solver topic page so that developers can more easily learn about it.
To associate your repository with the 8-puzzle-solver topic, visit your repo's landing page and select "manage topics."