Hill Climbing in AI
Hill climbing is a local search algorithm that improves one candidate solution at a time until no neighboring solution
Shalki Aggarwal
SE II at Microsoft | AI Expert
Latest Guides
Adversarial Search in Artificial Intelligence (AI)
Adversarial Search is the approach that an AI takes to make a decision on what move to make when another entity tries
Uniform Cost Search (UCS) in AI
Uniform Cost Search (UCS) is an uninformed search algorithm that searches for the path with the minimum cost between t
Greedy Best-First Search
The Greedy Best-First search algorithm uses only one numerical criterion to choose a node: the cost of reaching the ta
Bidirectional Search in AI
The Bidirectional search algorithm in AI uses a graph traversal method in which two searches are carried out simultane
Breadth-First Search
Breadth-first search (BFS) is a graph traversal algorithm that visits every node at the current distance from a starti
Rational Agents in AI
The rational agent of AI is the agent which performs the action that is expected to maximize the performance measure o
Heuristic Function in AI
Heuristic function refers to a mathematical function used in estimating the cost of getting to a goal state starting f
Minimax Algorithm in AI
Minimax is an approach to decision making whereby the strategy that minimizes the maximum possible loss in a two-playe
