ICT
January 4, 2025Communication
January 5, 2025Artificial-Intelligence
|
Question 8
|
What is the best method to go for the game playing problem?
|
Optimal Search
|
|
|
Random Search
|
|
|
Heuristic Search
|
|
|
Stratified Search
|
Question 8 Explanation:
→ Heuristic search is the best method to go for the game playing problem
→ A heuristic is a method that might not always find the best solution but is guaranteed to find a good solution in reasonable time.
Example: Hill Climbing, Simulated Annealing, Best first search,A* algorithm,etc..,
→ A heuristic is a method that might not always find the best solution but is guaranteed to find a good solution in reasonable time.
Example: Hill Climbing, Simulated Annealing, Best first search,A* algorithm,etc..,
Correct Answer: C
Question 8 Explanation:
→ Heuristic search is the best method to go for the game playing problem
→ A heuristic is a method that might not always find the best solution but is guaranteed to find a good solution in reasonable time.
Example: Hill Climbing, Simulated Annealing, Best first search,A* algorithm,etc..,
→ A heuristic is a method that might not always find the best solution but is guaranteed to find a good solution in reasonable time.
Example: Hill Climbing, Simulated Annealing, Best first search,A* algorithm,etc..,