GitHub - bmetea/SlidingPuzzle: How to find the optimal solution for solving a 8 or 15 sliding puzzle.

bmetea / SlidingPuzzle Public

forked from jDramaix/SlidingPuzzle

Notifications You must be signed in to change notification settings
Fork 0
Star 0

How to find the optimal solution for solving a 8 or 15 sliding puzzle.

0 stars 8 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
src		src
test/be/dramaix/ai/slidingpuzzle		test/be/dramaix/ai/slidingpuzzle
war		war
LICENSE		LICENSE
Readme.md		Readme.md

Repository files navigation

Source code for http://n-puzzle-solver.appspot.com/

About

How to find the optimal solution for solving a 8 or 15 sliding puzzle.

Report repository

Releases

No releases published

Packages

No packages published

Languages

Java 91.0%
HTML 6.8%
CSS 2.2%