previous
|
index
|
next
Best-First Search Example
The state with the lowest heuristic (
B
) is removed and the process is repeated:
previous
|
index
|
next