Check yourself -II

1)When would best first search be worse than simple breadth first search?

2)How will you represent knowledge?

3)Represent the following sentence in predicate form “All the children likes sweets”

4)Differentiate facts and events with example

5)why we need minmax tree?

1)Imagine a robot trying to move a desk from one place to another place.Assume the desk has two objects over it.write down the preconditions to move the desk and write the complete process using Means-Ends Analysis. Click here for answer(refer from slide no 9)

2)Explain alpha-beta pruning in min max tree with your own example