A* search algorithm implementation for solving 8-puzzle problem. Includes code modularization, performance optimization and solvability checking features.

A classic 8-puzzle game built in Python. Slide numbered tiles to achieve the target configuration. Fun for players of all levels!

8-puzzle implementation in Python using State space search algorithms

AI - Project 1 - 8-puzzle solver using bidirectional search

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

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

Puzzle8 solver - school project

8-Puzzle-Solver

🧩 Solver for N-Puzzle & N-Queens using Genetic Algorithms, A*, and more in Python

8-Puzzle solver in python using A* and manhatten heuristics

Simple BFS search to solve N-Puzzle Problem

Jogo 8-puzzle com soluções segundo Busca Custo Uniforme e Busca Heurística.

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

This is a simple 8-puzzle game solved using different search algorithms (A Star, BFS).

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

Solution of 8 Puzzle Problem in Python using Informed Search

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

8 puzzle and 15 puzzle game using Backtracking algorithm

This program tests different search algorithms to solve the 8 puzzle.

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.