McqMate

Q. |
## The __________algorithm explores the domain in a depth first manner. |

A. | backtracking |

B. | forward checking |

C. | arc consistency |

D. | strategic retreat |

Answer» A. backtracking |

2k

0

Do you find this helpful?

1

View all MCQs in

Artificial Intelligence and Robotics (AIR)No comments yet

- Which search algorithm imposes a fixed depth limit on nodes?
- Which of the following algorithm is generally used CSP search algorithm?
- Frame problem in STRIPS Domain can be solved by _____________________
- In a rule-based system, procedural domain knowledge is in the form of:___________
- Is the below statement true for the domain of positive integers ∀p ∃q ( p + q = 7)
- ___________ algorithm keeps track of k states rather than just one.
- Which is the most straightforward approach for planning algorithm?
- __________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.
- Which problem can frequently occur in backward chaining algorithm?
- The efficiency of A* algorithm depends on __________________________