ConceptAI & ML
Breadth-first search optimality
BFS is optimal if all action costs are the same because it finds the sequence of actions that is shortest to achieve the goal.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.