A* is also a search method for state space trees that combines most breakthroughs made in the field of state space search. its most imortant feature is that it tries to estimate how fruitful opening a given node might be and based on this, often finds paths without opening many unecessary nodes. if the estimation algorithm is perfect, then no unecessary nodes will be opened.