Week 3

Question 1

What are three adventages and a disadvantage of forward chaining

Answer 1

1) Cheap, no effort and just observing
2) sometimes we don’t want many observations because they are expensive (medical puproses)

Question 2

What is an advantage of backward chaining?

Answer 2

Need less observations

Question 3

Explain Hill climbing

Answer 3

DFS with knowledge so picking a path based on info

Question 4

What is optimal search

Answer 4

Finding path is not always the goal → shortest path is goal (without having to evaluate all possible paths)

Question 5

Explain branch-and-bound

Answer 5

Expanding nodes ordered by travelled distance
Once it finds a solution, it ignores any paths that would take as long or longer to reach the goal, since they wouldn’t be better.

Question 6

Explain adversarial search

Answer 6

How do i behave optimally if i know my opponent also want to behave optimally → 2 agents both make choices (checker, chess)

Question 7

Explain a-b algorithm

Answer 7

If you have an idea that is surely bad, do not take time to see how truly awful it is, not consider moves that are considered useless