Question

Explain best first search in artificial intelligence systems

Answer 1

$\mathbb{\red{\huge{Hey\:mate}}}$

$\boxed{Here\:is\:your\:@nswer}$⏺️☺️

━━━━━━━━━━━━━━━━━━━
$\mathfrak{\blue{Answer.}}$So both BFS and DFS blindly explore paths without considering any cost function. The idea of Best First Searchis to use an evaluation function to decide which adjacent is most promising and then explore. Best First Search falls under the category ofHeuristic Search or Informed Search.
━━━━━━━━━━━━━━━━━━━

$\huge{\bf{\blue {\fbox{\underline{\color{Blue}{Follow Me }}}}}}$
$<b><marquee>$
‌✌️ I THINK IT HELPED YOU ✌️