IAI Chapter 3 Problem Solving as Search
Questions about the lecture 'Introduction to Artificial Intelligence' of the RWTH Aachen Chapter 3 Problem Solving as Search
Questions about the lecture 'Introduction to Artificial Intelligence' of the RWTH Aachen Chapter 3 Problem Solving as Search
Set of flashcards Details
| Flashcards | 59 |
|---|---|
| Language | English |
| Category | Computer Science |
| Level | University |
| Created / Updated | 04.02.2017 / 11.02.2017 |
| Licencing | Not defined |
| Weblink |
https://card2brain.ch/box/20170204_iai_chapter_3_problem_solving_as_search
|
| Embed |
<iframe src="https://card2brain.ch/box/20170204_iai_chapter_3_problem_solving_as_search/embed" width="780" height="150" scrolling="no" frameborder="0"></iframe>
|
What is the definition of search?
Find the action sequence or solution path from a initial to goal states
What are characteristics of search? [3]
1. Completeness and optimality
2. Time-, memory complexity
3. Informed, heuristic or uninformed, blind
What is the definition of completeness?
If a solution exists, is it found?
What is the definition of optimality?
If a solution exists, is the best found?
What is the definition of time and memory complexity?
Time and memory used in a worst case
What is the definition of an informed, heuristic search? [2]
1. Additional information enhances the search
2. Assign nodes with evaluation function f
What are examples for informed, heuristic search strategies? [4]
1. Greedy search
2. A*
3. Hill-climbing
4. Simulated annealing
What is the definition of a uninformed, blind search?
No additional information
