Heuristic search in artificial intelligence
Planning as heuristic search
LAO∗: A heuristic search algorithm that finds solutions with loops
Searching stochastically generated multi-abstraction-level design spaces
A general scheme for automatic generation of search heuristics from specification dependencies☆
Exploiting symmetries within constraint satisfaction search☆
Minimax real-time heuristic search
Time complexity of iterative-deepening-A∗
Sokoban: Enhancing general single-agent search methods using domain knowledge
The PN∗-search algorithm: Application to tsume-shogi
Partial order bounding: A new approach to evaluation in game tree search
Special Issue of the journal Artificial Intelligence on “AI & Law”
Forthcoming Papers
Author Index—Volume 129 (2001)