Reconsideration of a theorem on admissible ordered search algorithms

Abstract

An improved proof is presented for a theorem on search algorithms which find minimal cost paths in a graph. The theorem essentially states that when searching for a minimal cost path in a graph, a more informed search algorithm expands fewer nodes than a less-informed algorithm. The proof does not require that the consistency assumption hold—an assumption that is necessary in the proof presented previously.