8-puzzle implementation in Python using State space search algorithms
-
Updated
Jul 30, 2024 - Python
8-puzzle implementation in Python using State space search algorithms
8 tiles puzzle problem is solved using A - Star algorithm in C++ programming language
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.
Simple BFS search to solve N-Puzzle Problem
Solving 8-puzzle with BFS and DFS algorithms
8-Puzzle Solver webapp it uses different search algorithms to solve the classic 8-puzzle problem.
The 8-puzzle-problem repository hosts a Jupyter Notebook detailing the solution strategies for the 8-puzzle, a sliding puzzle involving a 3x3 grid. The notebook includes implementations of various algorithms to solve the puzzle efficiently, demonstrating concepts from artificial intelligence and algorithm design.
Application of A* search algorithm in solving 8-puzzle problem.
🔢 🎮🕹 Implementação dos algoritmos de busca no problema do jogos dos 8 números.
8 puzzle solver, a python program that solves the modified version of Expense 8 puzzle problem using different algorithms,
This code solves the 8 puzzle problem with A star algorithm.
Implementing the 8 puzzle program, manhattan distance algorithm is used to find best path and also a learned through experience heuristic algorithm.
Auto slove 8-puzzle ploblem
Solving 8-puzzle problem
Finding optimal solution to a given configuration of the 8 puzzle problem
8-Puzzle solver in python using A* and manhatten heuristics
8 Puzzle Problem Solver built using reactJs
Solving 8-puzzle with BFS and DFS algorithms
Add a description, image, and links to the 8-puzzle-problem topic page so that developers can more easily learn about it.
To associate your repository with the 8-puzzle-problem topic, visit your repo's landing page and select "manage topics."