Across
- 2. function : Measures cost of solution
- 5. : Entity that perceives and acts
- 8. search : Search using heuristics
- 9. : Surroundings of an agent
- 13. : FIFO structure used in BFS
- 15. : Estimate to reach goal faster
- 17. solving : Finding solutions using AI techniques
- 18. : Rules for moving between states
- 20. state : Starting point of a problem
- 21. : Possible moves an agent can take
- 24. search : Chooses best immediate option
- 26. : Returning to previous state in search
- 27. cost : Cost to reach the goal
- 28. problem : Minor issue that can be ignored
Down
- 1. problem : Problem that can be fixed
- 3. space : All possible states in a problem
- 4. model : Result of applying an action
- 6. first search : Level-wise search using queue
- 7. : Search using g plus h function
- 10. solution : Best possible solution
- 11. : Exploring possible actions to reach a goal
- 12. state : Desired final outcome
- 14. search : Search without extra knowledge
- 16. problem : Problem that cannot be fixed
- 19. : Sequence of states to goal
- 22. : LIFO structure used in DFS
- 23. first search : Deep search using stack
- 24. test : Checks if goal is reached
- 25. cost search : Expands lowest cost path first
