An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C

42 Algorithm project that solve n-puzzle

Still in development (very passive)

N Puzzle game solved by BFS, DFS, A*, UCS, IDFS, Greedy

Using A*, BFS and IDDFS Algorithms to Solve a NxN Grid Sliding Puzzle

8-Puzzle-Solver

🧩 A simple n-puzzle solver

n-puzzle

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

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

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

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

Classic sliding puzzle game programmed in C++11. This program works on both Microsoft Windows and on Linux. 🧩

An N-puzzle solver written for a class project.

N-Puzzle game solver - Python - A* search algorithm - 42 School

Program utilizing an A* algorithm with various heuristics to solve nxn sliding puzzles. Outputting the steps required to solve the puzzle into txt files.

This Repository contains a solver for fifteen-puzzle To be specific, the NxN sliding puzzle solver in JAVA. The program uses a specific version of Kruskal Algorithm mainly known by A* algorithm with three different heuristics. It uses greedy version of the A* algorithm along side of different heuristics in order to achieve faster solutions

Classic n-puzzle problem solver using A* search

Contains all the assignments of the course CSE-318 offered in CSE, BUET

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.