Also known as 8-puzzle or 15-puzzle using A* algorithm
-
Updated
Aug 17, 2019 - Java
Also known as 8-puzzle or 15-puzzle using A* algorithm
Simple searcher engine to solve problems commonly been given to you if you'd taken AI class before.
AI algorithms
8 puzzle BFS in Java
Based on two inputted 8 puzzle states, all reachable states are generated and displayed, including common reachable states between the two.
Implementation of State Space Search algorithms for solving 8-puzzles.
Implementation of BDS using bfs and dfs
8 Puzzle Game
This program solves the 8-puzzle problem using heuristics and the following search algorithms: A* , IDA and Branch and Bound.
A simple 8 Puzzle Solver in Java capable of solving all combinations of legal 8 Puzzle games using a variety of algorithms as well as starting positions of the player’s choosing.
NxM puzzle solver using graph traversal algorithms
Algorithms I solutions http://algs4.cs.princeton.edu/code/
AI Lab Offlines and Onlines
Add a description, image, and links to the 8-puzzle topic page so that developers can more easily learn about it.
To associate your repository with the 8-puzzle topic, visit your repo's landing page and select "manage topics."