AISpace2 Main Tools News Downloads Prototype Tools Customizable Applets Practice Exercises Help About AIspace

What does the runtime distribution tell you about this solver? Greedy Descent is an incomplete algorithm, that is, it is not guaranteed to find a solution even given infinite time. That is why the runtime distribution flattens out.

Main Tools: Graph Searching | Consistency for CSP | SLS for CSP | Deduction | Belief and Decision Networks | Decision Trees | Neural Networks | STRIPS to CSP