My n-puzzle solver: A* and IDA* search, heuristics, different puzzle configurations and sizes
A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts
Sliding Puzzle solver and utilities
A sliding puzzle game and solver using ncurses.
Solves puzzles of various sizes
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.
Solving the sliding tiles puzzled using bdf, iddfs, gbfs and a*
An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C
AI that solves the N-Puzzle
Solving the 15-Puzzle sliding game with informed search algorithms and various heuristics.
Add a description, image, and links to the linear-conflict topic page so that developers can more easily learn about it.
To associate your repository with the linear-conflict topic, visit your repo's landing page and select "manage topics."