Question

Given below are two statements:

Statement I: A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintained.

Statement 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 I and Statement II are true
2. Both Statement I and Statement II are false
3. Statement I is correct but Statement II is false
4. Statement I is incorrect but Statement II is true

Answer 1

Correct Answer - Option 1 : Both Statement I and Statement II are true

The correct answer is option 1.

A genetic algorithm is a stochastic hill-climbing algorithm that maintains a wide population of states. Mutation and crossover, which blends pairs of states from the population, create new states.

Hence Statement I is correct.

Agents may use AND-OR search in non-deterministic environments to produce contingent plans that achieve the target regardless of which outcomes occur during execution.

Hence Statement II is correct

​

• AND-OR search trees: 
  • ​OR nodes: The only branching in a deterministic setting is implemented by the agent's own choices in each state; we call these nodes OR nodes.
  • AND nodes: Branching is often implemented in a non-deterministic setting by the environment's choice of outcome for each action, which we call nodes AND nodes.