---
title: "Single-Agent Parallel Window Search: A Summary of Results"
authors:
  - "Curt Powley"
  - "Richard E. Korf"
doi: ""
url: "https://ijcai.org/proceedings/1989/6"
pdf: "https://ijcai.org/proceedings/1989/0006.pdf"
venue: "Proceedings of the Eleventh International Joint Conference on Artificial Intelligence"
year: 1989
pages: "36-40"
track: "Tools"
keywords:
---

# Single-Agent Parallel Window Search: A Summary of Results

Curt Powley, Richard E. Korf

*Proceedings of the Eleventh International Joint Conference on Artificial Intelligence*, pages 36-40.

## Abstract

We show how node ordering can be combined with parallel window search to quickly find a nearly optimal solution to single-agent problems. First, we show how node ordering by maximum g among nodes with equal f = g + h values can improve the performance of IDA*. We then consider a window search where different processes perform IDA* simultaneously on the same problem but with different cost thresholds. Finally, we combine the two ideas to produce a parallel window search algorithm in which node ordering information is shared among the different processes. Parallel window search can be used to find a nearly optimal solution quickly, improve the solution until it is optimal, and then finally guarantee optimality, depending on the amount of time available.