Claim and evidence Close ×
Hart, Nilsson and Raphael (1968) describe how heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching, and state an optimality property for a class of search strategies. Copy claim link
Copy claim reference
Machine-checked, not reviewed by an editor Stated in source Supported
Supporting evidence: primary · 1 source; Context: primary · 1 source
Date 1968-07 · publication Records dated 1968 → Scope and limits Defining statement of the paper's approach, read from the scanned abstract; the optimality property is the paper's own claim, not checked here. The algorithm is named 'A*' in section II.
The evidence 02 primary source Supports the claim
A Formal Basis for the Heuristic Determination of Minimum Cost Paths ↗ IEEE Transactions on Systems Science and Cybernetics; scan hosted on a University of Auckland course page · 1968-07
Copy source reference
Cite the original source Cite the original document, not Selekoa. Check these details against it.
Copy APA
Download BibTeX Download RIS Download CSL-JSON
Paraphrase The abstract states that the paper describes how heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching, and demonstrates an optimality property of a class of search strategies.
Location in source PDF p. 1 (journal p. 100), Abstract
How it was read Retrieved directly from the publisher
Machine-checked · 2026-10-31
Source details and check notes Authors Peter E. Hart; Nils J. Nilsson; Bertram Raphael Version Retrieved for the candidate pack on 2026-10-29 (SHA-256 68905780affa771f22b0b6b83dde669bbce9246a62384d7d77ab9494f046e46e). Scan of the journal printing (vol. SSC-4, no. 2, July 1968, pp. 100–107); ai.stanford.edu copy refused (connection reset) Canonical address Open the canonical source ↗ Accessed 2026-10-29 Language English (en) Attribution Peter E. Hart, Nils J. Nilsson, Bertram Raphael, “A Formal Basis for the Heuristic Determination of Minimum Cost Paths”, 1968-07. Reuse No open redistribution licence asserted. Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution. Check notes Candidate pack passage, Kinds of AI and technical history (research/technical-history). The paraphrase is Selekoa’s, written from the text retrieved for the candidate pack on 2026-10-29; it is not a quotation and was not machine-matched. Read from the page image; no text layer. No human editorial review. primary source Context only
A Formal Basis for the Heuristic Determination of Minimum Cost Paths ↗ IEEE Transactions on Systems Science and Cybernetics; scan hosted on a University of Auckland course page · 1968-07
Copy source reference
Cite the original source Cite the original document, not Selekoa. Check these details against it.
Copy APA
Download BibTeX Download RIS Download CSL-JSON
Paraphrase The search procedure is set out under the heading 'Search Algorithm A*'.
Location in source PDF p. 3 (journal p. 102), section II.A
How it was read Retrieved directly from the publisher
Machine-checked · 2026-10-31
Source details and check notes Authors Peter E. Hart; Nils J. Nilsson; Bertram Raphael Version Retrieved for the candidate pack on 2026-10-29 (SHA-256 68905780affa771f22b0b6b83dde669bbce9246a62384d7d77ab9494f046e46e). Scan of the journal printing (vol. SSC-4, no. 2, July 1968, pp. 100–107); ai.stanford.edu copy refused (connection reset) Canonical address Open the canonical source ↗ Accessed 2026-10-29 Language English (en) Attribution Peter E. Hart, Nils J. Nilsson, Bertram Raphael, “A Formal Basis for the Heuristic Determination of Minimum Cost Paths”, 1968-07. Reuse No open redistribution licence asserted. Bibliographic metadata, editorial paraphrases and short attributed quotations (at most 50 words each). Recheck terms before wider redistribution. Check notes Candidate pack passage, Kinds of AI and technical history (research/technical-history). The paraphrase is Selekoa’s, written from the text retrieved for the candidate pack on 2026-10-29; it is not a quotation and was not machine-matched. Read from the page image. No human editorial review. Status and meaning Editorial status. Not reviewed by an editor . An exploratory record that no editor has accepted. This status does not say whether a person has read any linked passage. Each evidence record above shows how it was checked.
Relation. The concept is explicitly discussed in the document. This makes no earliest-use, invention or transmission claim.
Date. Date of publication, as the source gives it.
Record ID th-sp-def-astar-1968