Memory Functions in Iterative-Deepening Search
نویسندگان
چکیده
2
منابع مشابه
Enhanced Iterative-Deepening Search
|Iterative-deepening searchesmimic a breadthrst node expansion with a series of depthrst searches that operate with successively extended search horizons. They have been proposed as a simple way to reduce the space complexity of bestrst searches like A* from exponential to linear in the search depth. But there is more to iterative-deepening than just a reduction of storage space. As we show, th...
متن کاملBounded Suboptimal Search in Linear Space: New Results
Bounded suboptimal search algorithms are usually faster than optimal ones, but they can still run out of memory on large problems. This paper makes three contributions. First, we show how solution length estimates, used by the current stateof-the-art linear-space bounded suboptimal search algorithm Iterative Deepening EES, can be used to improve unboundedspace suboptimal search. Second, we conv...
متن کاملLinear-Space est-First Search: Summary of
Best-first search is a general search algorithm that, always expands next a frontier node of lowest cost. Its applicability, however, is limited by its exponential memory requirement. Iterative deepening, a previous approach to this problem, does not expand nodes in best-first, order if t’he cost, function can decrease along a path. We present a linear-space best-first search algorithm (RBFS) t...
متن کاملA New Paradigm for Minimax Search
This paper introduces a new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of Pearl’s Testprocedure. By changing the way MT is called, a number of best-first game-tree search algorithms can be simply and elegantly constructed (including SSS*). Most of the assessments of minimax search algorithms have been based on simulations. However, these simulations genera...
متن کاملBest-First Fixed-Depth Game-Tree Search in Practice
We present a new paradigm for minimax search algorithms: MT, a memory-enhanced version of Pearl's Test procedure. By changing the way MT is called, a number of practical best-first search algorithms can be simply constructed. Reformulating SSS* as an instance of MT eliminates all its perceived implementation drawbacks. Most assessments of minimax search performance are based on simulations that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991