recategorized
1,817 views
1 votes
1 votes

Math List-I with List-II:

$$\begin{array}{|c|l|c|l|} \hline {} & \text{List-I} & {}  & \text{List-II} \\ \hline (a) & \text{Greedy best-first} & (i) & \text{Minimal cost } (p)+h(p) \\ \hline (b) & \text{Lowest cost-first} & (ii) & \text{Minimal } h(p) \\ \hline (c) & A^* \text{ algorithm} & (iii) & \text{Minimal cost } (p) \\ \hline \end{array}$$

Choose the correct option from those given below:

  1. (a) – (i) ; (b) – (ii); (c) – (iii)
  2. (a) – (iii) ; (b) – (ii); (c) – (i)
  3. (a) – (i) ; (b) – (iii); (c) – (ii)
  4. (a) – (ii) ; (b) – (iii); (c) – (i)
recategorized

2 Answers

0 votes
0 votes

Greedy best first:  Minimal h(p)

Lowest cost: Minimal cost(p)

A* search: Minimal cost(p)+h(p) where, 

=> g = the movement cost to move from the starting point to a given square on the grid, following the path generated to get there. 
=> h = the estimated movement cost to move from that given square on the grid to the final destination. This is often referred to as the heuristic,

So,  option D is correct.

Answer:

Related questions

2 votes
2 votes
1 answer
1
Arjun asked Jul 2, 2019
3,116 views
Consider the game tree given below:Here $\bigcirc$ and $\Box$ represents MIN and MAX nodes respectively. The value of the root node of the game tree is$4$$7$$11$$12$
1 votes
1 votes
1 answer
2
Arjun asked Jul 2, 2019
2,439 views
The STRIPS representation isa feature-centric representationan action-centric representationa combination of feature-centric and action-centric representationsa hierarchi...
1 votes
1 votes
1 answer
3
1 votes
1 votes
2 answers
4
Arjun asked Jul 2, 2019
6,288 views
Consider the following:EvolutionSelectionReproductionMutationWhich of the following are found in genetic algorithms?b, c and d onlyb and d onlya, b, c and da, b and d onl...