- DATA.ML.310
- 11. Exam
- 11.1 Exam

# Exam¶

The exam consists of five topic questions, one from each topic discussed in this course, and a set of true-false-questions that can be from any of the topics.

Keep an eye on the time, and remember to **submit all of your answers before the time runs out**.
If the time runs out before submitting your answers, the grader does not give you points from that answer.

Keep an eye also on the number of submissions. For some of the questions, you can submit multiple answers.

In the exercises where you return a pdf file, there is no automatic grader. In these exercises, the grader will give you 1/25 points when submitting. These points are corrected when the teacher grades your submission.

## Topic 1¶

In this exercise, there are five short questions for different terms related to the subject of the module classical search and beyond. This exercise is graded automatically. Don’t worry if there is a typo in your answer and it will get zero points. Teachers will go through the answers and check if there are such cases.

## Topic 2¶

Consider the two-player game described as following.

The starting position of a simple game. Player A moves first. The two players take turns moving, and each player must move his token to an open adjacent space in either direction. If the opponent occupies an adjacent space, then a player may jump over the opponent to the next open space if any. (For example, if A is on 3 and B is on 2, then A may move back to 1.) The game ends when one player reaches the opposite end of the board. If player A reaches space 4 first, then the value of the game to A is +1; if player B reaches space 1 first, then the value of the game to A is −1.

- Draw the complete game tree, using the following conventions:

- Write each state as (s
_{A}, s_{B}), where s_{A}and s_{B}denote the token locations.- Put each terminal state in a square box and write its game value in a circle.
- Put loop states (states that already appear on the path to the root) in double square boxes. Since their value is unclear, annotate each with a “?” in a circle.

- Now mark each node with its backed-up minimax value (also in a circle). Explain how you handled the “?” values and why.
- Explain why the standard minimax algorithm would fail on this game tree

Return your answers in a single PDF file.

A+ presents the exercise submission form here.

A+ presents the exercise submission form here.