MilanPecov/15-Puzzle-Solvers
This project solves the classic 15-puzzle using A* and Breadth First algorithms, implemented in Python. It features a combined heuristic of Manhattan Distance, Linear Conflict, and Walking Distance for optimal performance and includes a user-friendly graphical interface to visualize the solution
PythonMIT
Stargazers
- albas99Ural Federal University
- ashaabanm
- bituplinkbituplink
- Chen-Mf
- cloudeyes
- cod1ropen source is cool
- Deabal
- DexterIV
- DimmDell
- diwwergg
- DrNaki
- dusky3Slovakia
- GaubGit1
- jesperalmstrom@Buzzcloud
- jiahualihuanahuanUniversity of Waterloo
- konradkozaŁódź
- LeonChaoHi
- Martin00088
- masonterSDU
- Mohamed-Dhouioui
- Paloys
- raetrakt
- Resare068
- Rishav-Singha-Deo3Dfx Next Studios
- romaromanUniversité de Genéve
- satyajeetkrjhaNew York ,USA
- slarkdarrJakarta
- South2North石家庄新东方烹饪学校
- steven-mathewToronto, Canada
- suzukisses
- systemfile36
- Tomingz
- William-H-MMedellín - Colombia
- woodencoderUber
- zichongshanghai
- zyrmj0212