edited by
1,732 views
0 votes
0 votes

Given below are two statements:

Statement $\text{I}$: A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintained

Statement $\text{II}$: In nondeterministic environments, agents can apply AND-OR search to generate contingent plans that reach the goal regardless of which outcomes occur during execution.

In the light of the above statements, choose the correct answer from the options given below

  1. Both Statement $\text{I}$ and Statement $\text{II}$ are true
  2. Both Statement $\text{I}$ and Statement $\text{II}$ are false
  3. Statement $\text{I}$ is correct but Statement $\text{II}$ is false
  4. Statement $\text{I}$ is incorrect but Statement $\text{II}$ is true
edited by

1 Answer

0 votes
0 votes

Ans is A) Both Statement I and Statement II are true

Refer Russel and Norvig book

https://www.cnblogs.com/RDaneelOlivaw/p/7821063.html

A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintained. New states are generated by mutation and by crossover, which combines pairs of states from the population.

In non deterministic environments, agents can apply AND-OR search to generate contingent plans that reach the goal regardless of which outcomes occur during execution.

AND-OR search trees

 OR nodes: In a deterministic environment, the only branching is introduced by the agent’s own choices in each state, we call these nodes OR nodes.

AND nodes: In a nondeterministic environment, branching is also introduced by the environment’s choice of outcome for each action, we call these nodes AND nodes.

Answer:

Related questions

0 votes
0 votes
1 answer
3
go_editor asked Nov 20, 2020
795 views
Match $\text{List I}$ with $\text{List II}$With reference to CMM developed by Software Engineering Institute (SEI)$\begin{array}{llll} & \text{List I} && \text{List II} \...
0 votes
0 votes
2 answers
4
go_editor asked Nov 20, 2020
1,001 views
Match $\text{list I}$ with $\text{List II}$$\begin{array}{llll} & \text{List I} && \text{List II} \\ (A) & \text{Topological sort of DAG} & (I) & O(V+E) \\ (B) & \text{Kr...