Artificial Intelligence ELSEVIER ARTIFICIAL INTELLIGENCE VOLUME 129, NUMBERS 1-2, JUNE 2001 Special Issue: Heuristic Search in Artificial Intelligence Guest Editors: Weixiong Zhang, Rina Dechter, Richard E. Korf CONTENTS W. Zhang, R. Dechter and R.E. Korf Heuristic search in artificial intelligence B. Bonet and H. Geffner Planning as heuristic search E.A. Hansen and S. Zilberstein LAO*: A heuristic search algorithm that finds solutions with loops L. Steinberg Searching stochastically generated multi-abstraction-level design spaces K. Kask and R. Dechter A general scheme for auiomatic generation of search heuristics from specification dependencies P. Meseguer and C. Torras Exploiting symmetries within constraint satisfaction search S. Koenig Minimax real-time heuristic search R.E. Korf, M. Reid and S. Edelkamp Time complexity of iterative-deepening-A’ A. Junghanns and J. Schaeffer Sokoban: Enhancing general single-agent search methods using domain knowledge M. Seo, H. lida and J.W.H.M. Uiterwijk The PN*-search algorithm: Application to tsume-shogi M. Muller Partial order bounding: A new approach to evaluation in game tree search Call for Papers Forthcoming Papers Author Index—Volume 129 (2001) CONTENTS urns art of ContentsDirect, the free alerting ser f ontents by e-ma for Elsevier Science s books and journals. You can register for ContentsDirect online at www.elsevier.ni/locate/contentsdirect