of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Artificial Intelligence 71 (1994) 195-208 We reproduce the abstract: The agent searching framework models the effort of a search strategy in terms of the distance traversed by an agent while exploring the search space. The fmmework has been found to be useful in modeling search problems where the cost of backtracking and retracing search paths is important in determining search complexity. In this paper we show that depth-first iterative deepening (DFID) strategies are optimal for an agent searching in a line, in m concurrent rays, and in uniform b-ary trees. In the conventional search model it is known that DFID is asymptotically optimal for uniformed search of uniform b-ary trees. In this paper we prove the stronger result that for agent searching in uniform b-ary trees, iterative deepening is optimal up to lower-order terms. We also discuss the problems involved in optimally performing agent search in a graph. A BIBLIOGRAPHY ON MINIMAX TREES Lausanne / SwitzerlandWe reproduce the abstract: This technical report lists all theoretical and practical papers, theses and reports known to the author on the subject of studying minimax trees and analyzing sequential and parallel minimax tree search algorithms (some 175 papers). A SURVEY ON MINIMAX TREES AND ASSOCIATED ALGORITHMS Claude G. Diderich and Marc Gengler 2 Lausanne / SwitzerlandWe reproduce the abstract: This paper surveys theoretical results about minimax game trees and the algorithms used to explore them. The notion of game trees is formally introduced and its relation with game playing described. The first part of the survey outlines major theoretical results about minimax game trees, their size and the structure of their subtrees. In the second part of this paper, we survey the various sequential algorithms that have been developed to explore minimax trees. The last part of this paper tries to give a succinct view on the state of the art in parallel minimax game tree searching.

No abstract

No abstract