Skip to content
This repository has been archived by the owner on Sep 5, 2018. It is now read-only.

Program that takes the state of a sliding puzzle game and determines the fastest solution to the game. It determines the fastest solution using four different algorithms: A* Heuristic 1, A* Heuristic 2, Backtracking, and GraphSearch.

Notifications You must be signed in to change notification settings

TannerJuby1/SlidingTilePuzzle

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 

About

Program that takes the state of a sliding puzzle game and determines the fastest solution to the game. It determines the fastest solution using four different algorithms: A* Heuristic 1, A* Heuristic 2, Backtracking, and GraphSearch.

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages