[closed] HW4-3 clarification

3

For the option
"A* MAY find a suboptimal path"

I take it to mean that it will always find a path, and that path may or may not be end up being a suboptimal path.

Is my interpretation correct?

asked 12 Mar '12, 23:35

billi_rush-1's gravatar image

billi_rush-1
952●3●9●15
accept rate: 0%

closed 12 Mar '12, 23:39

The question has been closed for the following reason "The question is answered, right answer was accepted" by billi_rush-1 12 Mar '12, 23:39

One Answer:
5

Yes, your interpretation is exactly right.

link

answered 12 Mar '12, 23:37

AndyAtUdacity's gravatar image

AndyAtUdacity ♦♦
53.9k●112●253●291

Is this for all spaces or just finite mazes? Thanks

(16 Mar '12, 05:23) Andy Hayden Andy%20Hayden's gravatar image

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "Title")
  • image?![alt text](/path/img.jpg "Title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported

learn more about Markdown

Tags:

×5,185
×69
×53

Asked: 12 Mar '12, 23:35

Seen: 506 times

Last updated: 16 Mar '12, 05:23

Related questions

Homework 4-3 Bad Heuristic - wrong correct answer?

HW4-4 clarification

[HW4-3] "Bad Heuristics" Grading

Hw 4 Python Compiler and Submission problem

[hw4-3] Infinite Search Space & Heuristics clarification [rephrased]

hw4-3: in what kind of world ?

Why is dynamic programming applicable to pathfinding with stochastic motion?

A gripe about unit 4 and some suggestions

HW4-3 Examples suggest option #3 is also correct.

Homework 4-3 clarification