Comparison of Greedy, A* Search, and Different Heuristics
You can compare Greedy and A* Search with a Burst Mode Algorithm
Race (Burst Mode). Either team up with the person sitting next to you,
or by invoking a second copy of the animation software.
Click here to start another copy of the software:
For both instances of the animation software: set the
same problem, and display mode. One instance should be
set for Greedy Search, and the other A* Search. Select a
problem, and start the animations simultaneously.
Experiment with different heuristics measures for each of Greedy
and A* Search.
Experiment with different problems. See if you can find some problems
that reveal a big difference in the operation of Greedy and A* search
Relative Size of Search Space Tree
To gain some small appreciation of the relatively small portion of
the "entire" search space some algorithms actually explore, have a look
at several problems in Burst Mode (Fixed 8-Puzzle Problem) mode.
This animation shows the relationship between the underlying search
space and the nodes that are actually realized in computer memory.
Once you've selected this mode, you'll be required to select
from a small range of fixed 8-Puzzle problems. A dialog box will appear
and present your with the choices. Click the "radio button" along side
the problem of your choice. Then click Ok
and then Start the animation as normal.