Greedy Best First Search
Step 1:
In practice section, create a graph, or use the preset tree and select both the starting node and the goal node.
Step 2:
Start the best first search algorithm and type the answer in the observation tab when it stops. It will automatically proceed if the answer is correct.
Step 3:
You have reached the end, when it says if you found the goal node. You can start again with different parameters.