The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
544 views

Consider $f(N) = g(N) + h(N)$ Where function g is a measure of the cost of getting from the start node to the current node $N$ and $h$ is an estimate of additional cost of getting from the current node $N$ to the goal node. Then $f(N) = h(N)$ is used in which one of the following algorithms ?

  1. $A^{*}$algorithm
  2. $AO^{*}$ algorithm
  3. Greedy best first search algorithm
  4. Iterative $A^{*}$ algorithm 
asked in Others by Boss (40.2k points)
retagged by | 544 views

2 Answers

0 votes

the given eqn
f(N)=g(N)+h(N)  belongs to A* algorithm(variant of Best First) in which g(N) i.e the cost of reaching to current node from start node is also considered in addition of h(N). In original greedy best first algorithm only h(N) i.e cost of going from current  node to goal node is considered(thats why it is greedy just find the  cost to reach the goal node which may not be optimal)

 so f(N)=h(N) belongs to greedy best first algorithm hence ans is C

answered by Boss (49.3k points)
0 votes

The Greedy Best-First-Search algorithm works in a way that it has some estimate (called a heuristic) of how far from the goal any vertex is. Instead of selecting the vertex closest to the starting point, it selects the vertex closest to the goal.

answered by Active (1.6k points)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

39,584 questions
46,707 answers
140,136 comments
57,865 users