|
|
Subject:
Re: A*
Author:
anonymous
Date:
2/20/2003
Yes Ofcourse A* search is complete
since it uses a function f=g+h
where g is the actual path cost n h is the heuristic
It is a catious way of approach n
a combination of uninformed n informed search strategy.
|
|