Menu

Question Discussion & Solution

MCQ
Q.
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.

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Web Crawler is a/an ____________
forum Discussion
MCQ
2.
Which search implements stack operation for searching the states?
forum Discussion
MCQ
3.
How many types of informed search method are in artificial intelligence?
forum Discussion
MCQ
4.
A production rule consists of ____________
forum Discussion
MCQ
5.
Hill-Climbing approach stuck for which of the following reasons?
forum Discussion

category More Artificial Intelligence Topics

article

Basic Artificial Intelligence

format_list_bulleted 116 MCQs
article

Intelligent Agents

format_list_bulleted 55 MCQs
article

Problem Solving

format_list_bulleted 96 MCQs
article

Logical Agents

format_list_bulleted 49 MCQs
article

Adversarial Search

format_list_bulleted 32 MCQs
article

Fuzzy Logic

format_list_bulleted 14 MCQs
article

Knowledge and Reasoning

format_list_bulleted 87 MCQs
article

Expert Systems

format_list_bulleted 10 MCQs
article

Robotics

format_list_bulleted 22 MCQs
article

Inductive Logic Programming

format_list_bulleted 15 MCQs
article

LISP Programming

format_list_bulleted 42 MCQs
article

Communicating, Perceiving and Acting

format_list_bulleted 68 MCQs
article

Introduction

format_list_bulleted 0 MCQs