Which is the best way to go for Game playing problem? – McqOptions

MCQOPTIONS

1.	Which is the best way to go for Game playing problem?
A.	Linear approach
B.	Heuristic approach (Some knowledge is stored)
C.	Random approach
D.	An Optimal approach
Answer» C. Random approach

Discussion

No Comment Found

Related MCQs

The process of removing detail from a given state representation is called______
The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False.
A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state.
_______________ Is an algorithm, a loop that continually moves in the direction of increasing value - that is uphill
Constraint Propagation technique actually modifies the CSP problem.
A_PROBLEM_SOLVING_APPROACH_WORKS_WELL_FOR?$
Web Crawler is a/an$
The_________is_a_touring_problem_in_which_each_city_must_be_visited_exactly_once._The_aim_is_to_find_the_shortest_tour.$
Which is the best way to go for Game playing problem?
Which search method takes less memory?