This paper proposes new real–time heuristic distributed parallel algorithms for search, which are based on the concepts of propagations and competitions of concurrent waves. These algorithms are characterized by simplicity and clearness of control strategies for search, and distinguished abilities in many aspects, such as real–time performance, wide suitability for searching AND/OR implicit graphs, and ease in hardware implementation.