187 1/3/2017 8:11:20 AM


:

 

OPEN = [initial state]

while OPEN is not empty

Sort OPEN according to g(n).

Remove the best node from OPEN, call it n.

if n is the goal state, return n as the solution.

Create n's successors.

For each successor

add it to OPEN.

done