-
Notifications
You must be signed in to change notification settings - Fork 0
A robot represented as a point moves in a regular two-dimensional NxN grid (e.g., N = 100). Each point of the grid is either "free" or "forbidden" (obstacle). From any position (i,j) in the grid the robot can reach each of the 4 adjacent positions (i,j-1), (i,j+1), (i-1,j), (i+1,j), if it is not forbidden. A navigation problem consists of findin…
pazukunous/Best-First-Robot-Navigation
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
Justin Saborouh [email protected] 2280128 TO COMPILE: g++ -o main *.cpp ./main [textFileGoesHere.txt] I only have three samples provided.
About
A robot represented as a point moves in a regular two-dimensional NxN grid (e.g., N = 100). Each point of the grid is either "free" or "forbidden" (obstacle). From any position (i,j) in the grid the robot can reach each of the 4 adjacent positions (i,j-1), (i,j+1), (i-1,j), (i+1,j), if it is not forbidden. A navigation problem consists of findin…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published