Iterative deepening depth-first search is a hybrid algorithm emerging out of BFS and DFS. IDDFS might not be used directly in many applications of Computer Science, yet the strategy is used in searching data of infinite space by incrementing the depth limit by progressing iteratively. This is q...
Kazi Shamsul Arefin, Aloke Kumar Saha, A new approach of iterative deepening bi-directional heuristic front-to-front algorithm (IDBHFFA), Int. J. Electr. Comput. Sci. (IJECS-IJENS) 10 (2) (2010).A new approach of iterative deepening bi‐directional heuristic fron...
The algorithm is evaluated over a set of random tree search problems, and is found to be more efficient than IDMOA~*, a previous extension of IDA~* to the multiobjective case.J. CoegoL. MandowJ. L. Perez de la CruzAI*IA 2009: Artificial Intelligence and Human-Oriented Computing: X...
In this algorithm, the state values of the nodes in each layer of the game tree are comprehensively considered. During the process of extending the game tree, a static heuristic function is used to evaluate the state value of each node, which is called its evaluation value, 𝑒_𝑣𝑎...