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.
NxM puzzle solver using graph traversal algorithms
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.
Also known as 8-puzzle or 15-puzzle using A* algorithm
Algorithms I solutions http://algs4.cs.princeton.edu/code/
Simple searcher engine to solve problems commonly been given to you if you'd taken AI class before.
Semester 6: AI. Program to solve the 8-puzzle problem using A* search algorithm
8 Puzzle Game
8 puzzle BFS in Java
AI algorithms
Based on two inputted 8 puzzle states, all reachable states are generated and displayed, including common reachable states between the two.
8-puzzle solver in Java comparing uniform-cost search, A* with a simple heuristic and A* with Manhattan distance, with a GUI to follow the search.
AI Lab Offlines and Onlines
Java implementation of search algorithms for solving the 8-puzzle problem, including UCS and A* Search.
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."