Skip to content
ml-recall

#bfs

3 questions from Search & Planning

Timed test

3 questions · 3 min · score and explanations at the end

Take a test
Q 1 / 3Score 0 / 0

Question 1: Short answer

easyAI-checkedSearch & Planning

Breadth-first search runs on a tree in which every node has exactly b=3b = 3 children. The shallowest goal is at depth d=4d = 4 and is the last node generated at that depth. BFS applies the goal test as soon as a node is generated. Counting the root, how many nodes has BFS generated when it finds the goal?

a whole number