A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A Survey on Minimax Trees and Associated Algorithms
1994
ICGA Journal
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
doi:10.3233/icg-1994-17413
fatcat:fcvdjsyqnbevdkdzkpapooyvl4