Skip to content

Given the size n, initial state, and search method, you can solve a sliding puzzle through the use of BFS, DFS, GBFS, and/or AStar.

Notifications You must be signed in to change notification settings

Tole-Git/Sliding-Puzzle-Solver

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

Sliding-Puzzle-Solver

Est. June 2021 Author: Tony Le

Given the size n, initial state, and search method, you can solve a sliding puzzle through the use of BFS, DFS, GBFS, and/or AStar.

About

Given the size n, initial state, and search method, you can solve a sliding puzzle through the use of BFS, DFS, GBFS, and/or AStar.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages