Optimal problem-solving search: All-or-none solutions

摘要

Optimal algorithms are derived for satisficing problem-solving search, that is, search where the goal is to reach any solution, no distinction being made among different solutions. This task is quite different from search for best solutions or shortest path solutions.Constraints may be placed on the order in which sites may be searched. This paper treats satisficing searches through partially ordered search spaces where there are multiple alternative goals.