this a python BFS , A* and RBFS implementation of 8 puzzle

8 puzzle solver using BFS, DFS, IDDFS and A-star algorithm

Implemented the 8 puzzle problem using DFS, BFS in python

BFS, IDS, Greedy & A* applied to the 8-puzzle problem. ⚙️

Python script for solving the classic "8-puzzle" game

Solve, test and benchmark algorithms for N-Puzzle problem with Python

Implementation of the 8-Puzzle problem using A* Search Algorithm

Optimised 8-puzzle solver using BFS, DFS, and A* Algorithms

8 puzzle problem simulation.

Using heuristic search Best-First and A* with BFS (with manhatan distance) methods to solve 8-puzzle

🕹 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.

8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.

8-puzzle game is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing

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.

Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University

The stupid 8-puzzle game using several search techniques

N-Puzzle implementation with BFS, DFS, Greedy and A*

This repository contains solver to 8 Puzzle Problem using A* algorithm and manhattan distance as heuristics.

Artificial Intelligence 8-puzzle solver; The 8-puzzle problem is played on a 3-by-3 grid with 8 square tiles labeled 1 through 8 and a blank tile.

Solve the N-puzzle (best known as the 8 puzzle game) using a min priority queue and the A* search algorithm