You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I want to generate a BFS tree that will be based of A* so that it derives of it.
If a solution is found after searching <= max l nodes, your program will display the solution
using the same format as indicated above.
f(n) = 0 + h(n)
where g(n) = 0
Acceptance of Criteria:
g(n) = 0
Derive from A* so that f(n) = 0 + h(n)
The text was updated successfully, but these errors were encountered:
As a user,
I want to generate a BFS tree that will be based of A* so that it derives of it.
If a solution is found after searching <= max l nodes, your program will display the solution
using the same format as indicated above.
where g(n) = 0
Acceptance of Criteria:
The text was updated successfully, but these errors were encountered: