Eamon Earl

Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions

Greedy search methods such as Greedy Best-First Search (GBFS) and Enforced Hill-Climbing (EHC) often struggle when faced with Uninformed Heuristic Regions (UHRs) like heuristic local minima or plateaus. In this work, we theoretically and empirically compare two popular methods for escaping UHRs: bre