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

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

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

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

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

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

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

Implemented the 8 puzzle problem using DFS, BFS in python

8 puzzle problem simulation.

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

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

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

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.

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

电子科技大学 2020 级《人工智能》课程代码。

An implementation of the A* search algorithm to solve the 8-puzzle problem, with two different heuristics.

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

Solution of 8 Puzzle Problem in Python using Informed Search

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