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...
A New Approach of Iterative Deepening Bi-Directional Heuristic Front-to-Front Algorithm (IDBHFFA)Artificial Intelligence (AI) is a subject that studies techniques for making computers exhibit intelligent behavior. Searching still remains one of the problem in AI. Bi-directional search is perform...
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 addition, estimating the node types introduces extra complexity to the search process. With the present work, we would like to move the stance further by presenting a novel refinement of the minimax algorithm, called the iterative optimal minimax (IOM) algorithm. The main idea is to improve...