Home › Per Red Blob Games (Intro to A*), BREADTH-FIRST …
Per Red Blob Games (Intro to A*), BREADTH-FIRST SEARCH on an unweighted graph guarantees which property of the result?
AAlways faster than A* in practice
BShortest path in number of edges
CMinimum memory used always
DHex-grid optimality only
Answer & Solution
Correct answer: B. Shortest path in number of edges
Red Blob Games BFS chapter: BFS explores by levels, guaranteeing the shortest path in #edges for unweighted graphs.
Related questions
Per Red Blob Games (movement costs), if some terrain costs MORE to traverse, Dijkstra's alPer Reynolds' Steering Behaviors (commonly cited in game AI), 'SEEK' behaviour produces whIn game AI, a BEHAVIOR TREE typically uses which TWO compositional node types?In game AI design, a FINITE STATE MACHINE (FSM) is best suited for modelling which?In standard game AI literature, a NavMesh (navigation mesh) represents walkable terrain asPer Red Blob Games (Map Representations), a HEX grid offers which advantage over a square Per Red Blob Games, an ADMISSIBLE heuristic h(n) satisfies which property?Per Red Blob Games, for an 8-direction grid (with diagonals at √2 cost), the recommended h