Answers on the bottom. Also, you can bring a notecard (5in x 7in
max) with notes or whatnot.

Turing test

True or false? Turing first described a test between a monkey and a
human before describing a test between a human and a machine.

True or false? The goal of the machine is to convince the judge that
the human is a machine.

True or false? To pass the Turing test, the machine should be expected
to fool the judge (convince the judge that the machine is a human)
nearly 100% of the time; or, maybe just 70% of the time.

True or false? Dennett thinks that winning a chess championship is
just as strong a test for computer intelligence as the Turing test.

Search

General search

Give an initial state, describe possible actions and the transition
model (i.e., how states connect), and specify a goal criterion for the
following search problem:

A robot wants a path to exit a maze. The maze is represented as a
square grid; open areas are represented by white grid cells, and walls
are represented by black grid cells.

Repeat this exercise for the following search problem:

Recall from calculus that the derivative is the inverse of the
integral. Finding the derivative of a formula is easy (no search
needed). But finding the integral of a formula is often challenging,
and may require a search procedure. Describe this search procedure.

Complete the following table for weighted (different branches have
different costs), finite search graphs:

Search algorithm

Always complete?

Always optimal?

Uses a heuristic?

Random search

Breadth-first search

Yes

Depth-first search

No

Best-first search

A* search

Yes

Recall the Goodale route search problem from Practice with searching
notes. Answer the following questions for each of breadth-first
search, depth-first search, best-first search, and A* search (using
some heuristic like distance "as the crow flies"). Assume we start at
Woodruff & Tuttle and the goal is Goodale parking lot. For each
question, there may be more than one correct answer.

What are the first two states (beyond Woodruff & Tuttle) that
will be checked?

What does the tocheck list look like after checking those
states from question 1? Be sure to order the list by an
appropriate sort order (breadth-first, best-first, and A* will
take the next state from the front of the list; depth-first will
take the next state from the end).

What is the singular requirement for a heuristic to be called
"admissible?"

Adversarial search

Describe a utility function for an adversarial search procedure (e.g.,
minimax) for playing chess.

True or false? Minimax is an appropriate search procedure for
single-player games (like a solitaire card game or a Rubik's cube)?

True or false? Alpha-beta pruning, as applied to the minimax
procedure, produces more optimal solutions (e.g., produces game moves
that allow the computer to win in fewer moves).

Recall from calculus that the derivative is the inverse of the
integral. Finding the derivative of a formula is easy (no search
needed). But finding the integral of a formula is often challenging,
and may require a search procedure. Describe this search procedure.

initial state: the starting formula that needs a symbolic integral
to be found

possible actions / transition model: create a database like this:

sin(x) --> -cos(x)

cx --> cx^2/2

x^n --> (x^(n+1)/(n+1))

…

goal criterion: say you are looking at a new formula g, and the
original formula is f, then you want dg/dx = f; every "state"
(formula) is checked in this way

Complete the following table for weighted (different branches have
different costs), finite search graphs:

Search algorithm

Always complete?

Always optimal?

Uses a heuristic?

Random search

Yes

No

No

Breadth-first search

Yes

No

No

Depth-first search

Yes

No

No

Best-first search

Yes

No

Yes

A* search

Yes

Yes

Yes

Recall the Goodale route search problem from Practice with searching
notes. Answer the following questions for each of breadth-first
search, depth-first search, hill-climbing search, best-first search,
and A* search (using some heuristic like distance "as the crow
flies"). Assume we start at Woodruff & Tuttle and the goal is
Goodale parking lot. For each question, there may be more than one
correct answer.

What are the first two states (beyond Woodruff & Tuttle) that
will be checked?

breadth-first (one possible answer): Lane & Tuttle, High &
Woodruff

depth-first (one possible answer): Lane & Tuttle, SR-315 &
Lane

best-first (only answer): High & Woodruff, High & 15th

A* (only answer): Lane & Tuttle, High & Woodruff

What does the tocheck list look like after checking those
states from question 1? Be sure to order the list by an
appropriate sort order (breadth-first, hill-climbing, best-first,
and A* will take the next state from the front of the list;
depth-first will take the next state from the end). Assume
already-checked states are not added.