Advertisement
Guest User

Untitled

a guest
Apr 24th, 2015
209
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.26 KB | None | 0 0
  1. s 1 X 1 X
  2. 1 X 1 1 1
  3. 1 1 X 1 X
  4. X 1 G 1 X
  5. 1 1 1 1 1
  6.  
  7. 1. start at the starting position, current = start;
  8. 2. Find the neighbor that has least number of neighboring obstacles (conflicts),
  9. 3. Update current to that neighbor state, and
  10. 4. repeat until goal is found.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement