A star search - HiIAmTzeKean/SC3000-Artificial-Intelligence GitHub Wiki
tags:
- 🌱
- AI
- ComputerScience
- Search date: 18--Apr--2023 modified: 22--Oct--2023
- Uses Uniform cost search and Greedy search
- g(n) as path cost to n
- h(n) as estimated cost from n to goal
- Cutting the search space
- Complete
- Not complete. The state space must be guaranteed to have a solution and finite.
- Optimal
- No. If its not complete, optimality cannot be guaranteed.
- Time
- Similar to Greedy search O(b^d)
- Space
- All nodes are kept in the frontier
- O(b^d)
Links: