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

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.

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

Solving 8-puzzle problem

implementation of AI problems in python

8 tiles puzzle problem is solved using A - Star algorithm in C++ programming language

This code solves the 8 puzzle problem with A star algorithm.

Finding optimal solution to a given configuration of the 8 puzzle problem

Simple cpp project for solving the 8-puzzle problem

8 Puzzle Problem Solver built using reactJs

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

Search algorithms for 8-puzzle problem search problem and traveling salesman optimization problem.

Repository for programming project one under ITCS 6150 Intelligent Systems under Dr. Dewan Ahmad for the fall 2021 semester. The aim is to solve the 8-puzzle problem using an A star search algorithm based on the heuristic function chosen by the user. The programming language chosen for this project is Python 3

8-puzzle implementation in Python using State space search algorithms

Simple BFS search to solve N-Puzzle Problem

Solving 8-puzzle with BFS and DFS algorithms

The 8-puzzle-problem repository hosts a Jupyter Notebook detailing the solution strategies for the 8-puzzle, a sliding puzzle involving a 3x3 grid. The notebook includes implementations of various algorithms to solve the puzzle efficiently, demonstrating concepts from artificial intelligence and algorithm design.

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