8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.
-
Updated
Nov 11, 2022 - Python
8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.
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
A simple 8-puzzle game made with VueJS
implementation of AI problems in python
This repository contains solver to 8 Puzzle Problem using A* algorithm and manhattan distance as heuristics.
Implementation of A* search algorithm for the 8 puzzle 🎮
Solve 8-puzzle, a type of sliding tile puzzle, by Classic Search 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.
8-Puzzle Solver webapp it uses different search algorithms to solve the classic 8-puzzle problem.
Simple BFS search to solve N-Puzzle Problem
Solving 8-puzzle with BFS and DFS algorithms
8 tiles puzzle problem is solved using A - Star algorithm in C++ programming language
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.
Application of A* search algorithm in solving 8-puzzle problem.
🔢 🎮🕹 Implementação dos algoritmos de busca no problema do jogos dos 8 números.
8 puzzle solver, a python program that solves the modified version of Expense 8 puzzle problem using different algorithms,
Finding optimal solution to a given configuration of the 8 puzzle problem
Implementing the 8 puzzle program, manhattan distance algorithm is used to find best path and also a learned through experience heuristic algorithm.
Add a description, image, and links to the 8-puzzle-problem topic page so that developers can more easily learn about it.
To associate your repository with the 8-puzzle-problem topic, visit your repo's landing page and select "manage topics."