Answer / waqar ahmad

Deterministic

 A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above

0 Answers  

---

What are the basic aspects of the robotics?

0 Answers  

---

What are the capabilities of expert systems?

0 Answers  

---

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

0 Answers  

---

In which of the following agent does the problem generator is present? a) Learning agent b) Observing agent c) Reflex agent d) None of the mentioned

1 Answers  

---

What is travelling salesman problem?

0 Answers  

---

When do we call the states are safely explorable? a) A goal state is unreachable from any state b) A goal state is denied access c) A goal state is reachable from every state d) None of the mentioned

3 Answers  

---

What is the use of the function (copy-list <list>) in lisp?

0 Answers  

---

What is the action of task environment in artificial intelligence? a) Problem b) Solution c) Agent

0 Answers  

---

he process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data

1 Answers  

---

What is a difference in robot system and ai programs?

0 Answers  

---

What brute-force search strategies?

0 Answers  

---