#### Filter Results:

- Full text PDF available (94)

#### Publication Year

1980

2016

- This year (0)
- Last 5 years (14)
- Last 10 years (37)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Richard E. Korf
- Artif. Intell.
- 1990

We apply the two-pluyer game assumprio~ls of 1i111ited search horizon and cornn~itnrent to nroves i constant time, to .single-agent heuristic search problems. We present a varicrtion of nrinimcr lookuhead search, and an analog to ulphu-betu pruning rlrot signijicantly improves the efficiency c. the algorithm. Paradoxically. the search horizon reachuble with… (More)

- Richard E. Korf
- Artif. Intell.
- 1985

The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. I t is known that breadth-first search requires too much space and depth-first search can use too much time and doesn't always find a cheapest path. A depth-first iteratiw-deepening algorithm is shown to be asymptotically optimal along al l three… (More)

- Richard E. Korf
- IJCAI
- 1985

- Richard E. Korf
- AAAI/IAAI
- 1997

We have found the first optimal solutions to random instances of Rubik’s Cube. The median optimal solution length appears to be 18 moves. The algorithm used is iterative-deepening-A* (IDA*), with a lowerbound heuristic function based on large memory-based lookup tables, or “pattern databases” (Culberson and Schaeffer 1996). These tables store the exact… (More)

- Richard E. Korf
- Artif. Intell.
- 1993

Korf, R.E., Linear-space best-first search, Artificial Intelligence 62 (1993) 41-78. Best-first search is a general heuristic search algorithm that always expands next a frontier node of lowest cost. It includes as special cases breadth-first search, Dijkstra's single-source shortest-path algorithm, and the A* algorithm. Its applicability, however, is… (More)

- Richard E. Korf
- Artif. Intell.
- 1987

- Richard E. Korf
- Artif. Intell.
- 1985

- Richard E. Korf, Peter Schultze
- AAAI
- 2005

Recently, best-first search algorithms have been introduced that store their nodes on disk, to avoid their inherent memory limitation. We introduce several improvements to the best of these, including parallel processing, to reduce their storage and time requirements. We also present a linear-time algorithm for bijectively mapping permutations to integers… (More)

- Richard E. Korf, Ariel Felner
- Artif. Intell.
- 2002

We describe a new technique for designing more accurate admis sible heuristic evaluation functions based on pattern databases While many heuristics such as Manhattan distance compute the cost of solving individual subgoals independently pattern databases consider the cost of solving multiple subgoals simultaneously Exist ing work on pattern databases allows… (More)

- Toru Ishida, Richard E. Korf
- IJCAI
- 1991

We consider the case of heuristic search where the location of the goal may change during the course of the search. For example, the goal may be a target that is actively avoiding the problem solver. We present a moving target search algorithm (MTS) to solve this problem. We prove that if the average speed of the target is slower than that of the problem… (More)