1 Introduction

2 Preliminaries: Review of A*

3 Parallel Best-First Search Algorithms

4 Hash-Based Decentralized A*

5 Decentralized Search Using Structure-based Search Space Partitioning

6 Hash Functions for Hash-Based Decentralized Work Distribution

7 Parallel Portfolios using A*

8 Parallel, Limited-Memory A* (Parallel IDA*, TDS, PRA*)

9 Parallel A* in Cloud Environments with Practically Unlimited Available Resources

10 Parallel A* and IDA* on Graphics Processing Units

11 Other Approaches