This project is a demonstration of the Greedy Best First Search (GBFS) algorithm — an informed search algorithm that uses a heuristic to guide its pathfinding decisions. It's designed to help users understand how GBFS works through an intuitive, hands-on experience.
-
Notifications
You must be signed in to change notification settings - Fork 0
A project implements the 'Greedy Best First Search' algorithm.
License
FarrelAD/Greedy-Best-First-Search
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A project implements the 'Greedy Best First Search' algorithm.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published