The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.
a) Forward search
b) Backtrack search
c) Hill algorithm
d) Reverse-Down-Hill search
Answer Posted / devjit mandal
b
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned
What is a difference in robot system and ai programs?
What is the use of the microcontroller in the robotics?
What is computer vision?
What is ai? Why do we implement ai in the robots?
What does the language of fopl consists of?
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
What is meant by simulated annealing in artifical intelligence? a) Returns an optimal solution when there is a proper cooling schedule b) Returns an optimal solution when there is no proper cooling schedule c) It will not return an optimal solution when there is a proper cooling schedule d) None of the mentioned
Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned
A problem solving approach works well for a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)
What are the characteristics of ai expert systems?
for online search in ‘artificial intelligence’ which search agent operates by interleaving computation and action?
Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor
Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned
How logical inference can be solved in propositional logic?