Using heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle
-
Updated
Oct 12, 2021 - Python
Using heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle
AI solver for the clasic N-puzzle Game with UI using raylib
🕹 Algoritmo que resolve o jogo dos oito por busca em profundidade(sem estados visitados), busca em largura(com estados visitados), busca gulosa(com estados visitados) e busca a*(com estados visitados). Podendo mostrar passo a passo das escolhas dos nós e mostrando a árvore resultante(até um certo limite ou completa) do método de busca selecionado.
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.
8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.
🔢 🎮🕹 Implementação dos algoritmos de busca no problema do jogos dos 8 números.
8 Puzzle Game
8 puzzle and 15 puzzle game using Backtracking algorithm
A simple project to implement A* algorithm.
Trabalho de Inteligência Artifical - UFPI
8-puzzle implementation in Python using State space search algorithms
Implementation of A* search algorithm for the 8 puzzle 🎮
Auto slove 8-puzzle ploblem
Solving TACI 8-Puzzle using heuristic search
Informed and Uninformed search algorithms
A classic 8-puzzle game built in Python. Slide numbered tiles to achieve the target configuration. Fun for players of all levels!
8-puzzle-game made with pygame and use A* to solve the game
Numeric 8 Puzzle in pygame
Add a description, image, and links to the 8-puzzle-game topic page so that developers can more easily learn about it.
To associate your repository with the 8-puzzle-game topic, visit your repo's landing page and select "manage topics."