In hidden markov model, how does the state of the process is described?

0 Answers  

---

 What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both a & b

0 Answers  

---

Which is the best way to go for game playing problem?

0 Answers  

---

___________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

0 Answers  

---

Which agent enables the deliberation about the computational entities and actions? a) Hybrid b) Reflective c) Relational d) None of the mentioned

0 Answers  

---

How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4

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  

---

What is single agent pathfinding problems?

0 Answers  

---

What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned

0 Answers  

---

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

0 Answers  

---

An omniscient agent knows the actual outcome of its actions and can act accordingly; but omniscience is impossible in reality. Rational Agent always does the right thing; but Rationality is possible in reality. State true or false a) True b) False

0 Answers  

---

 In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

0 Answers  

---