A web-app that can solve 8-puzzle and visualize the search tree

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

A BFS and A* implementation to the classic 8-puzzle problem

Solutions to the classic 8 puzzle, implementing an A* best search algorithm to complete the puzzle in multiple languages.

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

This repository contains generic platform for solving and benchmarking computational puzzles using different search strategies

8-puzzle game that features a walkthrough of the optimal solution and allows users to customize the tiles using photos from their Gallery

Implemented the 8 puzzle problem using DFS, BFS in python

8 puzzle problem simulation.

This is an Artificial Intelligence project which solves the 8-Puzzle problem using different Artificial Intelligence algorithms techniques like Uninformed-BFS, Uninformed-Iterative Deepening, Informed-Greedy Best First, Informed-A* and Beyond Classical search-Steepest hill climbing.

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

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

Classic n-puzzle problem solver using A* search

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.

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

AI solver for the clasic N-puzzle Game with UI using raylib

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.

Also known as 8-puzzle or 15-puzzle using A* algorithm

🔢 🎮🕹 Implementação dos algoritmos de busca no problema do jogos dos 8 números.