greedy-bfs

Here are 3 public repositories matching this topic...

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.

Tugas Kecil 3 IF2211 Strategi Algoritma ITB

Rush Hour puzzle Solver dengan algoritma pathfinding Uniform Cost Search, Greedy Best First Search, dan A*.

Add a description, image, and links to the greedy-bfs topic page so that developers can more easily learn about it.

To associate your repository with the greedy-bfs topic, visit your repo's landing page and select "manage topics."