Question#1
Is the generate-and-test search algorithm used for large problem spaces?
a) True ✅
b) False

Question#2
Does the generate-and-test search algorithm always find the best solution?
a) True
b) False ✅

Question#3
Is A* search algorithm used in path finding problems?
a) True ✅
b) False

Question#4
Does A* algorithm consider both actual and estimated costs?
a) True ✅
b) False

Question#5
Is the heuristic function in A* algorithm represented by h(n)?
a) True ✅
b) False

Question#6
Does A* algorithm guarantee the optimal path if the heuristic is admissible?
a) True ✅
b) False

Question#7
Is adversarial search used in game-playing AI?
a) True ✅
b) False

Question#8
Does adversarial search involve a single agent?
a) True
b) False ✅

Question#9
Is pruning a technique used in adversarial search?
a) True ✅
b) False

Question#10
Does the minimax algorithm use depth-first search?
a) True ✅
b) False

Question#11
Is the minimax algorithm used for two-player games?
a) True ✅
b) False

Question#12
Does the minimax algorithm always choose the path with maximum utility for max?
a) True ✅
b) False

Question#13
Is Deep Blue an example of a rule-based game-playing AI?
a) True ✅
b) False

Question#14
Does machine learning-based game-playing AI improve over time?
a) True ✅
b) False

Question#15
Is AlphaGo a machine learning-based system?
a) True ✅
b) False

Question#16
Does game playing in AI have real-world applications?
a) True ✅
b) False

Question#17
Is the minimax algorithm computationally inexpensive?
a) True
b) False ✅

Question#18
Does the minimax algorithm use a heuristic evaluation function?
a) True ✅
b) False

Question#19
Is the minimax algorithm optimal for all types of games?
a) True
b) False ✅

Question#20
Does the minimax algorithm require the game to be zero-sum?
a) True ✅
b) False