SEARCH
You are in browse mode. You must login to use MEMORY

   Log in to start


From course:

Intro to AI 1

» Start this Course
(Practice similar questions for free)
Question:

Breadth-first search definition?

Author: Christian N



Answer:

Expand shallowest unexpanded node fringe is a first in, first out queue (FIFO)


0 / 5  (0 ratings)

1 answer(s) in total