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

How does this compare with plain Greedy Descent? How would the two algorithms compare if you gave them 10000 steps? Random Walk performs very poorly compared to Greedy Descent. However, since Greedy Descent is incomplete, for long runtimes (such as 10000 steps), Random Walk performs better.

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