Answer / nishant

b) Environment Generator

The game of Poker is a single agent. a) True b) False

0 Answers  

---

 What among the following constitutes to the incremental formulation of CSP? a) Path cost b) Goal cost c) Successor function d) Objective function e) Initial state

0 Answers  

---

 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)

0 Answers  

---

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

1 Answers  

---

Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) Sudoku

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  

---

What is called as exploration problem? a) State and actions are unknown to the agent b) State and actions are known to the agent c) Only actions are known to agent d) Both b & c

1 Answers  

---

 ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the above

1 Answers  

---

. What is state space? a) The whole problem b) Your Definition to a problem c) Problem you design d) Representing your problem with variable and parameter

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  

---

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

0 Answers  

---

Mention the difference between statistical ai and classical ai ?

0 Answers  

---