"Depth-First Iterative-Deepening: An Optimal Admissible Tree Search."

Richard E. Korf (1985)

> Home

Details and statistics

DOI: 10.1016/0004-3702(85)90084-0

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ai/Korf85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ai/Korf85
Richard E. Korf:
Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Artif. Intell. 27(1): 97-109 (1985)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.