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



Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ..

Answer / devjit mandal

c

Is This Answer Correct ?    4 Yes 0 No

Post New Answer

More AI Robotics Interview Questions

 Which were built in such a way that humans had to supply the inputs and interpret the outputs? a) Agents b) AI system c) Sensor d) Actuators

0 Answers  


What are roles in ai career?

0 Answers  


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

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  


What is natural language processing?

0 Answers  






How many types of agents are there in artificial intelligence? a) 1 b) 2 c) 3 d) 4

1 Answers  


Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned

0 Answers  


Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned

0 Answers  


Which of the following algorithm is online search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

0 Answers  


What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned

0 Answers  


In which state spaces does the online-dfs-agent will work? a) Irreversible state spaces b) Reversible state spaces c) searchable state spaces d) All of the mentioned

0 Answers  


In inductive logic programming what needed to be satisfied?

0 Answers  


Categories