Andy Mayer

Learn More
Introduction This paper addresses a prevailing assumption in single-agent heuristic search theory-that problem-solving algorithms should guarantee shortest-path solutions, which are ty pically called optimal. Optimality implies a metric for judging solution quality, where the optimal so­ lution is the solution with the highest quality. When path-length is(More)
  • 1