top of page
logo
Start Studying

Chapter 04: Beyond 
Classical search

ARTIFICIAL INTELLIGENCE MODERN APPROACH

Chapter Audio

Deepen your comprehension by listening to the curated audio discussion for this segment. This resource breaks down complex theories into digestible insights for effective retention.

Buy the Book

Visual Summaries

  • AI4.png
  • done 1.jpg
  • done 2.jpg

Table Summary

m4.png

Core Terminology

Master key academic terminology through active recall and spaced repetition concepts.

global minimum

In a state-space landscape, if elevation corresponds to cost, the goal is to find the _____.

Local Maximum

A peak that is higher than all its neighboring states but lower than the global maximum.

sideways

Allowing _____ moves in hill climbing helps escape shoulders but can lead to infinite loops on flat local maxima.

Random-restart hill climbing.

Which variant of hill climbing is 'trivially complete' with probability approaching 1 by repeatedly starting from new states?

decreases

As the 'temperature' T decreases in simulated annealing, the probability of accepting 'bad' moves _____.

Genetic Algorithm

A variant of stochastic beam search where successor states are generated by combining two parent states (crossover) rather than modifying one.

Chapter Quiz

Which topographic feature of a state-space landscape is described as a sequence of local maxima that greedy algorithms find very difficult to navigate?

In an AND–OR search tree for nondeterministic environments, what characterizes an AND node?

In the context of local search algorithms, what is the primary advantage of using a single current node rather than maintaining multiple paths in memory?

How does local beam search fundamentally differ from simply running k random-restart hill-climbing searches in parallel?

In the theory of genetic algorithms, what is a 'schema'?

Answers: D, A, A, C, D

bottom of page