Artificial intelligence: tools, techniques, and applications
Artificial intelligence: tools, techniques, and applications
Artificial intelligence: the very idea
Artificial intelligence: the very idea
Artificial intelligence
Principles of artificial intelligence
Principles of artificial intelligence
Introduction to artificial intelligence
Introduction to artificial intelligence
Reasoning about action II: the qualification problem
Artificial Intelligence
Practical planning: extending the classical AI planning paradigm
Practical planning: extending the classical AI planning paradigm
LISP
A Computer Model of Skill Acquisition
A Computer Model of Skill Acquisition
Artificial Intelligence and the Design of Expert Systems
Artificial Intelligence and the Design of Expert Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Planning for Conjunctive Goals
Planning for Conjunctive Goals
Levels of pattern description in learning
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
Blocks world (cube world) has been one of the most popular model domains in artificial intelligence search and planning. The operation and effectiveness of alternative heuristic strategies, both basic and complex, can be observed easily in this domain. We show that finding an optimal solution is NP-hard in an important variant of the domain, and popular extensions. This enlarges the range of model domains whose complexity has been explored mathematically, and it demonstrates that the complexity of search in blocks world is on the same level as for sliding block problems, the traveling salesperson problem, binpacking problems, and the like. These results also support the practice of using blocks world as a tutorial search domain in courses on artificial intelligence, to reveal both the value and limitations of heuristic search when seeking optimal solutions.