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
8-puzzle game is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing
Using heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle
Implemented the 8 puzzle problem using DFS, BFS in python
Implementation of the 8-Puzzle problem using A* Search Algorithm
Python script for solving the classic "8-puzzle" game
8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.
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.
The 8-puzzle problem is a puzzle invented and popularized by Noyes Palmer Chapman in the 1870s. It is played on a 3-by-3 grid with 8 square blocks labeled 1 through 8 and a blank square. Your goal is to rearrange the blocks so that they are in order.
Explore A* search for solving 3x3 and 4x4 puzzles
🔢 🎮🕹 Implementação dos algoritmos de busca no problema do jogos dos 8 números.
Solving 8-puzzle problem with search algorithms
Finding optimal solution to a given configuration of the 8 puzzle problem
8 puzzle solver using: BFS, DFS, A* (Manhattan, Euclidean)
This is a simple 8-puzzle game solved using different search algorithms (A Star, BFS).
A* and IDA* algorithms on 8-Puzzle
Program to solve 8-puzzle problem using Breadth First Search (BFS)
8 puzzle and 15 puzzle game using Backtracking algorithm
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."