The iterative-deepening A* search of a Domain. More...

Files
file	IDAStar.h
	Header file for the class template IDAStar, the iterative-deepening A* of Korf (1985), which finds an optimal path with a memory linear in its length: a depth-first search bounded by \( f = g + h \), repeated with the bound raised each time to the least \( f \) that exceeded it.

Classes
class	IDAStar< D >
	the iterative-deepening A* search of a Domain More...

Detailed Description

The iterative-deepening A* search of a Domain.

Files