Single-page web app for learning about graph search algorithms, such as Depth-First Search and A* Search

My n-puzzle solver: A* and IDA* search, heuristics, different puzzle configurations and sizes

A-List of all the Assignment done in Artificial Intelligence Course @IIIT-D

15-puzzle game in typescript with algorithmic solver.

N-Puzzle implementation with BFS, DFS, Greedy and A*

A C++ project which efficiently solves any given N-puzzle using backtracking on a decision tree.

8-puzzle solver. A*, RBFS, IDS algorithms, different puzzle sizes.

A collection of game AI

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

Classic n-puzzle problem solver using A* search

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

🕹 Algoritmo que resolve o jogo dos oito por busca em profundidade(sem estados visitados), busca em largura(com estados visitados), busca gulosa(com estados visitados) e busca a*(com estados visitados). Podendo mostrar passo a passo das escolhas dos nós e mostrando a árvore resultante(até um certo limite ou completa) do método de busca selecionado.

Python code to solve a 15 number puzzle using breadth-first-search algorithm.

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

The N-puzzle is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. The puzzle can be of any size, with the most common sizes being 3x3 and 4x4. The objective of the puzzle is to rearrange the tiles to form a specific pattern.

Implementation of algorithms to solve N-Puzzles in haskell

8 Puzzle problem solution with A* algorithm, BFS, and DFS.

Solution of 8 Puzzle Problem in Python using Informed Search