Solving 8-puzzle with BFS and DFS algorithms

In addition to Jigsaw, n-Puzzle using picture and AI to solve it

My implementation of a 8-Puzzle Solver using A* search algorithm.

8-Puzzle solver using BFS, DFS, and A* search with different heuristics.

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

使用启发式搜索解决8数码问题，前期版本基于STL维护open表和close表效率比较低，后期版本使用哈希映射进行了优化。

Machine Problem 1 in Computer Science 170: Introduction to Artificial Intelligence

Solver for the 8-puzzle problem using the following algorithms: BestFS (using Manhattan's distance as a heuristic function) , DFS and BFS.

A C++ implementation to solve the classic 8-puzzle game using standard and modified versions of A*.

A* algorithm solving 8-puzzle game

Backing up codes I wrote, during my Artificial Intelligence course.

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.

This is the artificial intelligence problem solving project. This work has been done during the course of Artificial Intelligence in my bachelors degree. There are three problems in this project; United Federation of Planets (UFP), Raju’s Patterns and 8-Puzzle which have been solved through AI algorithms.

A sliding block puzzle, whose solution is found using A* Search.

A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts

An 8-Puzzle Problem solver.

Artificial intelligence HW

A sliding puzzle game and solver using ncurses.