Optimal Problem-Solving Search: All-or-None Solutions

Abstract

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 search. This paper treats satisficing searches through partially ordered search spaces where there are multiple alternative goals.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1974
Accession Number
ADA009141

Entities

People

  • Herbert Simon
  • Joseph B. Kadane

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Artificial Intelligence
  • Equations
  • Excavation
  • Mathematics
  • Permutations
  • Probability
  • Scientific Research
  • Sequences
  • Terminals
  • Trees (Data Structures)
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Organizational Psychology.

Technology Areas

  • Space
  • Space - Space Objects