8 puzzle solver using BFS, DFS, IDDFS and A-star algorithm
-
Updated
May 20, 2021 - Python
8 puzzle solver using BFS, DFS, IDDFS and A-star algorithm
Implemented the 8 puzzle problem using DFS, BFS in python
Python script for solving the classic "8-puzzle" game
Implementation of the 8-Puzzle problem using A* Search Algorithm
Using heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle
8-Puzzle solver using A* Search with the manhattan & hamming heuristic
8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.
8-puzzle game is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing
An 8-puzzle game solver implementation in Python, uses informed and uninformed search algorithms and is extensible to be used on an N-Puzzle game.
8 puzzle solver using: BFS, DFS, A* (Manhattan, Euclidean)
8-Puzzle solver
Explore A* search for solving 3x3 and 4x4 puzzles
Solving 8-puzzle problem with search algorithms
This repository contains solver to 8 Puzzle Problem using A* algorithm and manhattan distance as heuristics.
This app built by modularization of controller, data, algorithm and UI. An 8 Puzzle Solver using brute force search algorithm written in Python and used PyQt5 library for UI.
Program to solve 8-puzzle problem using Breadth First Search (BFS)
Finding optimal solution to a given configuration of the 8 puzzle problem
Solving 8-Puzzle with BFS (Breadth First Search) Algorithm <Completed>#
AI coursework consisting of an 8-puzzle and a Sudoku solver using AI methods
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."