Across
- 3. Desired outcome or condition to achieve
- 5. Starting point where Al agent begins solving
- 6. Limitations or restrictions on agent operations
- 8. Function that estimates cost to goal in informed search
- 9. Data structure used in DFS for tracking visited nodes
- 10. Explores all nodes at present depth level (FIFO queue)
- 11. Search algorithm combining past cost and heuristic (f=g+h)
- 12. Type of problem with minimal impact on Al system
- 13. Model describing environment changes with agent actions
- 14. Representation containing all problem-solving information
Down
- 1. Challenge: agent lacks necessary data
- 2. Finds least cost path in weighted graph
- 4. Algorithm exploring deepest branch before backtracking
- 7. Informed search using heuristic evaluation
- 11. Operations or moves agent can perform between states