BFS can be used to find shortest path on an undirected graph between two nodes. Knight is the start node and princess is the end node. Add dragons into the board to block knight's path, using BFS knight will find shortest possible path to the princess. There are evil dragons on the board hurry up...
-
Notifications
You must be signed in to change notification settings - Fork 1
naveenkala/Path-Finder-BFS
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Path finding algorithm on a grid using BFS.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published