Computer Science, asked by shazmaalvi, 7 months ago

is there a search problem in which breadth first search is guranteed to reach the goal while uniform cost search fails?if yes explain,if no explain

Answers

Answered by Anonymous

167

Answer:

yes there r too many problems

Previous Question

Next Question

Similar questions

Math, 3 months ago

23a²-[7a-{11a²-9a-(23-15a-17a²)}] ...

English, 3 months ago

Meaning. Of disclaimer ...

Math, 3 months ago

4. The ratio of 40 cm to 1 m 1 point is......

Political Science, 7 months ago

Socialism Lays emphasis on economic justice...

Math, 7 months ago

Bindu (4'3) ki y aksh se lambavat duri kya h...

Business Studies, 10 months ago

A trader brought 10kg of tea at 400 per kg .He sold half the quantity at 20% loss and remaining at 10% profit what was his profit or loss in percent...

Math, 10 months ago

Find the least positive integer divisible by first five natural numbers...

Math, 10 months ago

Find the area of a rhombus whose perimeter is 200m and one of the diagonal is 80m...