Random minimaxing, introduced by Beal and Smith <degree>ICCA J. 17 (1994) 3-9<pilcrow>, is the process of using a random static evaluation function f...

We analyze the time complexity of iterative-deepening-A* (IDA*). We first show how to calculate the exact number of nodes at a given depth of a regul...

Real-time heuristic search methods interleave planning and plan executions and plan only in the part of the domain around the current state of the ag...

Symmetry often appears in real-world constraint satisfaction problems, but strategies for exploiting it are only beginning to be developed. Here, a f...

The paper presents and evaluates the power of a new scheme that generates search heuristics mechanically for problems expressed using a set of functi...