On Transposition Tables for Single-Agent Search and Planning: Summary of Results
نویسندگان
چکیده
Transposition tables are a well-known method for pruning duplicates in heuristic search. This paper presents a detailed analysis of transposition tables for IDA*. We show that some straightforward implementations of IDA* with transposition tables (IDA*+TT) can result in suboptimal solutions being returned. Furthermore, straightforward implementations of IDA*+TT are not complete. We identify several variants of IDA*+TT which are guaranteed to return the optimal solution, as well as a complete variant. An empirical study shows that IDA*+TT can significantly improve upon the performance of A* in domain-independent planning.
منابع مشابه
Analysis of Transposition Tables and Replacement Schemes
A set of experiments were designed to measure the enhancement to alphabeta search using refutation and transposition tables. Results indicate that the use of transposition tables can reduce the size of the game tree by as much as 95%, significantly improving the algorithmic performance of αβ search. Seven replacement schemes to handle collisions in transposition tables were proposed and their p...
متن کاملSearching for Chess
Chess programs have three major components: move generation, search, and evaluation. All components are important, although evaluation with its quiescence analysis is the part which makes each program's play unique. The speed of a chess program is a function of its move generation cost, the complexity of the position under study and the brevity of its evaluation. More important, however, is the...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملTransposition Table Driven Work Scheduling in Distributed Search
This paper introduces a new scheduling algorithm for parallel single-agent search, transposition table driven work scheduling, that places the transposition table at the heart of the parallel work scheduling. The scheme results in less synchronization overhead, less processor idle time, and less redundant search effort. Measurements on a 128-processor parallel machine show that the scheme achie...
متن کاملTransposition Tables in Computer
Search algorithms are used in many game-playing programs. To enhance the strength of these programs additional heuristics and improvements are used. One of these improvements is the use of transposition tables. In these tables information concerning a position investigated can be stored in order to re-use this information when the same position is encountered again during the search process (a ...
متن کامل