Python script for solving the classic "8-puzzle" game
-
Updated
Jun 23, 2015 - Python
Python script for solving the classic "8-puzzle" game
Implementation of the 8-Puzzle problem using A* Search Algorithm
A* and IDA* algorithms on 8-Puzzle
Optimised 8-puzzle solver using BFS, DFS, and A* Algorithms
This repository contains solver to 8 Puzzle Problem using A* algorithm and manhattan distance as heuristics.
The stupid 8-puzzle game using several search techniques
Artificial Intelligence. A* Algorithm. Minimax Algorithm and Alpha-Beta pruning
BFS, IDS, Greedy & A* applied to the 8-puzzle problem. ⚙️
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.
N-Puzzle implementation with BFS, DFS, Greedy and A*
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
🕹 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.
Add a description, image, and links to the 8-puzzle topic page so that developers can more easily learn about it.
To associate your repository with the 8-puzzle topic, visit your repo's landing page and select "manage topics."