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) True
b) False


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More AI Robotics Interview Questions

Describe the various phases of a robotics life cycle?

0 Answers  


What is a robot?

0 Answers  


Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

1 Answers  


 Which were built in such a way that humans had to supply the inputs and interpret the outputs? a) Agents b) AI system c) Sensor d) Actuators

0 Answers  


 A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False

0 Answers  






 In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b

0 Answers  


Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

0 Answers  


how we install a artificial intelligence software to our computer ?

0 Answers  


What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned

0 Answers  


What is the use of the microcontroller in the robotics?

0 Answers  


What is the rule of simple reflex agent? a) Simple-action rule b) Condition-action rule c) Both a & b d) None of the mentioned

0 Answers  


For building a bayes model how many terms are required?

0 Answers  


Categories