Uniform cost search.

4.2kviews

written 6.8 years ago by

teamques10 ★ 70k

modified 4.3 years ago by

krithikkm200 • 10

artificial intelligence data structures and algorithms

ADD COMMENT EDIT

1 Answer

189views

written 6.8 years ago by

teamques10 ★ 70k

BFS is optimal when all step costs are equal, because it always expands the shallowest un expanded node. By a simple extension, we can find an algorithm that is optimal with any step cost function. Instead of expanding the shallowest node, uniform cost search expands the node n with the …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.