huyvohcmc/8-puzzle
Java program to solve the 8 puzzle problem using branch and bound algorithm.
This program helps you find the shortest sequence of moves to solve an 8-puzzle (also known as a sliding puzzle or a N-puzzle) from any starting configuration. You input the initial jumbled state of the puzzle, and it outputs the step-by-step solution. This is useful for anyone studying or teaching artificial intelligence search algorithms.
No commits in the last 6 months.
Use this if you need to quickly find the optimal solution path for an 8-puzzle problem to understand or demonstrate search algorithms.
Not ideal if you're looking for a user-friendly game interface or a generalized solver for puzzles beyond the 8-puzzle.
Stars
19
Forks
16
Language
Java
License
MIT
Category
Last pushed
Feb 22, 2018
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/huyvohcmc/8-puzzle"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
YashIndane/webcube
Rubik's cube assistant on Flask webapp
mahdavipanah/pynpuzzle
Solve, test and benchmark algorithms for N-Puzzle problem with Python
kyo-takano/alphacube
A powerful & flexible Rubik's Cube solver
NiloofarShahbaz/8-puzzle-search-implementation
this a python BFS , A* and RBFS implementation of 8 puzzle
suhasasumukh/AI-Rubiks-Cube-Solver
A tool that uses ai to solve any complex Rubik's Cube pattern step by step.