Finding optimal solution to a given configuration of the 8 puzzle problem
Solving 8-Puzzle with BFS (Breadth First Search) Algorithm <Completed>#
Open source 8-puzzle automatic solver
AI coursework consisting of an 8-puzzle and a Sudoku solver using AI methods
A demonstration of A* and BFS search in the 8-puzzle game
Also known as 8-puzzle or 15-puzzle using A* algorithm
A* search algorithm in TypeScript
puzzles in AI is a collection of intelligent agents written in Python to solve different arcade games. This project was created for the purposes of experimenting with the implementation of game playing and puzzle solving using AI techniques.
Basic 8-puzzle solver using A* search
8-15Puzzle Solver A* (Manhattan Distance)
Trabalho de Inteligência Artifical - UFPI
Solve 8-Puzzle with A* algorithm in C# Console App.
🔢 🎮🕹 Implementação dos algoritmos de busca no problema do jogos dos 8 números.
Classic n-puzzle problem solver using A* search
Project 1 for ITCS 6150: Intelligent Systems.
A simple project to implement A* algorithm.
8 Puzle Solution with A* Algorithm in Python
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."