Consider a best$-$ rst search with the objective function of f$($n$)=(2$ w$)$g$($n$)+$w h$($n$)$ where g$($n$)$ is the path cost from the initial state to n and h$($n$)$ is an admissible heuristic.