Java program to solve the 8 puzzle problem using branch and bound algorithm.
-
Updated
Feb 22, 2018 - Java
Java program to solve the 8 puzzle problem using branch and bound algorithm.
A command line utility used to solve the 8-puzzle game. It is written to demonstrate the A* Search algorithm and using heuristics to find a goal state.
Algorithms I solutions http://algs4.cs.princeton.edu/code/
NxM puzzle solver using graph traversal algorithms
AI Lab Offlines and Onlines
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.
Also known as 8-puzzle or 15-puzzle using A* algorithm
Based on two inputted 8 puzzle states, all reachable states are generated and displayed, including common reachable states between the two.
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
Implementation of State Space Search algorithms for solving 8-puzzles.
Implementation of BDS using bfs and dfs
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."