Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Depth-first iterative-deepening: An optimal admissible tree search

Depth-first iterative-deepening: An optimal admissible tree search http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Artificial Intelligence Unpaywall

Depth-first iterative-deepening: An optimal admissible tree search

Artificial IntelligenceFeb 1, 1986

Depth-first iterative-deepening: An optimal admissible tree search

Artificial IntelligenceFeb 1, 1986

Loading next page...
 
/lp/unpaywall/depth-first-iterative-deepening-an-optimal-admissible-tree-search-L6lxRC8k65

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Unpaywall
ISSN
0004-3702
DOI
10.1016/0004-3702(86)90035-4
Publisher site
See Article on Publisher Site

Abstract

Journal

Artificial IntelligenceUnpaywall

Published: Feb 1, 1986

There are no references for this article.