AI Ch05 Game

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/29

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 6:01 AM on 10/6/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

30 Terms

1
New cards

D. 10

[game-tree] In the game tree show below, the first level is a MAX level (node a), the second is a MIN level (node b), the third is a MAX level (node c and node d), and the fourth is a MIN level.Use MINIMAX to obtain the value of each node (node a to node e) ___ . node a

<p>[game-tree] In the game tree show below, the first level is a MAX level (node a), the second is a MIN level (node b), the third is a MAX level (node c and node d), and the fourth is a MIN level.Use MINIMAX to obtain the value of each node (node a to node e) ___ . node a</p>
2
New cards

D. 10

[game-tree] In the game tree show below, the first level is a MAX level (node a), the second is a MIN level (node b), the third is a MAX level (node c and node d), and the fourth is a MIN level.Use MINIMAX to obtain the value of each node (node a to node e) ___ . node b

<p>[game-tree] In the game tree show below, the first level is a MAX level (node a), the second is a MIN level (node b), the third is a MAX level (node c and node d), and the fourth is a MIN level.Use MINIMAX to obtain the value of each node (node a to node e) ___ . node b</p>
3
New cards

D. 10

[game-tree] In the game tree show below, the first level is a MAX level (node a), the second is a MIN level (node b), the third is a MAX level (node c and node d), and the fourth is a MIN level.Use MINIMAX to obtain the value of each node (node a to node e) ___ . node c

<p>[game-tree] In the game tree show below, the first level is a MAX level (node a), the second is a MIN level (node b), the third is a MAX level (node c and node d), and the fourth is a MIN level.Use MINIMAX to obtain the value of each node (node a to node e) ___ . node c</p>
4
New cards

F. 14

[game-tree] In the game tree show below, the first level is a MAX level (node a), the second is a MIN level (node b), the third is a MAX level (node c and node d), and the fourth is a MIN level.Use MINIMAX to obtain the value of each node (node a to node e) ___ . node d

<p>[game-tree] In the game tree show below, the first level is a MAX level (node a), the second is a MIN level (node b), the third is a MAX level (node c and node d), and the fourth is a MIN level.Use MINIMAX to obtain the value of each node (node a to node e) ___ . node d</p>
5
New cards

D. 10

[game-tree] In the game tree show below, the first level is a MAX level (node a), the second is a MIN level (node b), the third is a MAX level (node c and node d), and the fourth is a MIN level.Use MINIMAX to obtain the value of each node (node a to node e) ___ . node e

<p>[game-tree] In the game tree show below, the first level is a MAX level (node a), the second is a MIN level (node b), the third is a MAX level (node c and node d), and the fourth is a MIN level.Use MINIMAX to obtain the value of each node (node a to node e) ___ . node e</p>
6
New cards

ABCDEFG

[game-tree] Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.)Give a chronologically ordered list of the nodes visited (including the final goal node) for each search strategy.

Breadth-First Search

<p>[game-tree] Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.)Give a chronologically ordered list of the nodes visited (including the final goal node) for each search strategy.</p><p>Breadth-First Search</p>
7
New cards

ABDEHI

[game-tree] Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.)Give a chronologically ordered list of the nodes visited (including the final goal node) for each search strategy.

Depth-First Search

<p>[game-tree] Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.)Give a chronologically ordered list of the nodes visited (including the final goal node) for each search strategy.</p><p>Depth-First Search</p>
8
New cards

AABCABDECFG

[game-tree] Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.)Give a chronologically ordered list of the nodes visited (including the final goal node) for each search strategy.

IDS

<p>[game-tree] Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.)Give a chronologically ordered list of the nodes visited (including the final goal node) for each search strategy.</p><p>IDS</p>
9
New cards

ACFG

[game-tree] Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.)Give a chronologically ordered list of the nodes visited (including the final goal node) for each search strategy

.Best-First Search

<p>[game-tree] Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.)Give a chronologically ordered list of the nodes visited (including the final goal node) for each search strategy</p><p>.Best-First Search</p>
10
New cards

ABECI

[game-tree] Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.)Give a chronologically ordered list of the nodes visited (including the final goal node) for each search strategy.

A* Search

<p>[game-tree] Consider the search tree below. The initial state is at the top, and the goal states are G and I, represented by the double-bordered rectangles. (Note that this is a search tree. The edges are directed.)Give a chronologically ordered list of the nodes visited (including the final goal node) for each search strategy.</p><p>A* Search</p>
11
New cards

Node5 with value=17

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.

13, 16, 5, 0, 17, 3, 18

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.</p><p>13, 16, 5, 0, 17, 3, 18</p>
12
New cards

Node4 with value=13

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.

15, 15, 9, 13, 5, 4, 8

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.</p><p>15, 15, 9, 13, 5, 4, 8</p>
13
New cards

Node3 with value=15

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.

7, 6, 15, 4, 12, 3, 9, 0, 10

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.</p><p>7, 6, 15, 4, 12, 3, 9, 0, 10</p>
14
New cards

Node4 with value=14

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.

3, 2, 11, 14, 2, 18, 16, 15, 11

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.</p><p>3, 2, 11, 14, 2, 18, 16, 15, 11</p>
15
New cards

greater than or equal to 3

[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none". If pruning will happen for all values of x, select "all".

Cutting off 1 and 5

<p>[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none". If pruning will happen for all values of x, select "all".</p><p>Cutting off 1 and 5</p>
16
New cards

none

[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none". If pruning will happen for all values of x, select "all".

Cutting off 4

<p>[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none". If pruning will happen for all values of x, select "all".</p><p>Cutting off 4</p>
17
New cards

none

[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none". If pruning will happen for all values of x, select "all".

Cutting off 1

<p>[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none". If pruning will happen for all values of x, select "all".</p><p>Cutting off 1</p>
18
New cards

10

[game-tree] In the game tree show below, the first level is a MAX level, the second is a MIN level, the third is a MAX level and the fourth is a MIN level. Each leaf-node shows its value for MiniMax search, and each node is labeled (from left to right) as L1, L2, ... Use MINIMAX to obtain the estimate of the position at root node (Max Node).

<p>[game-tree] In the game tree show below, the first level is a MAX level, the second is a MIN level, the third is a MAX level and the fourth is a MIN level. Each leaf-node shows its value for MiniMax search, and each node is labeled (from left to right) as L1, L2, ... Use MINIMAX to obtain the estimate of the position at root node (Max Node).</p>
19
New cards

Node4 with value=16

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.

9, 17, 8, 16, 6, 18, 2, 18

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.</p><p>9, 17, 8, 16, 6, 18, 2, 18</p>
20
New cards

Node5 with value=14

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.

11, 15, 3, 2, 14, 11, 2, 18, 16

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.</p><p>11, 15, 3, 2, 14, 11, 2, 18, 16</p>
21
New cards

Node4 with value=19

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned

13, 14, 12, 19, 13, 3, 14, 16

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned</p><p>13, 14, 12, 19, 13, 3, 14, 16</p>
22
New cards

L4

[game-tree] In the game tree show below, the first level is a MAX level, the second is a MIN level, the third is a MAX level and the fourth is a MIN level. Each leaf-node shows its value for MiniMax search, and each node is labeled (from left to right) as L1, L2, ... Apply alpha-beta pruning to the tree. Some leaves need not be evaluated (to be pruned). Which will be the first leaf-node to be pruned?

<p>[game-tree] In the game tree show below, the first level is a MAX level, the second is a MIN level, the third is a MAX level and the fourth is a MIN level. Each leaf-node shows its value for MiniMax search, and each node is labeled (from left to right) as L1, L2, ... Apply alpha-beta pruning to the tree. Some leaves need not be evaluated (to be pruned). Which will be the first leaf-node to be pruned?</p>
23
New cards

greater than or equal to 2

[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none". If pruning will happen for all values of x, select "all".

Cutting off 6

<p>[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none". If pruning will happen for all values of x, select "all".</p><p>Cutting off 6</p>
24
New cards

Alpha is negative infinity

[game-tree] In the game tree show below, the first level is a MAX level, the second is a MIN level, the third is a MAX level and the fourth is a MIN level. Each leaf-node shows its value for MiniMax search, and each node is labeled (from left to right) as L1, L2, ... Apply alpha-beta search to the tree. Some leaves need not be evaluated (to be pruned). After processing all the nodes below, what would be the alpha value or beta value of the node (that is, the parent of L1 and L2) shown below for alpha and beta values?

<p>[game-tree] In the game tree show below, the first level is a MAX level, the second is a MIN level, the third is a MAX level and the fourth is a MIN level. Each leaf-node shows its value for MiniMax search, and each node is labeled (from left to right) as L1, L2, ... Apply alpha-beta search to the tree. Some leaves need not be evaluated (to be pruned). After processing all the nodes below, what would be the alpha value or beta value of the node (that is, the parent of L1 and L2) shown below for alpha and beta values?</p>
25
New cards

less than or equal to 1

[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none". If pruning will happen for all values of x, select "all". (Note: Δ is Maximizer, ∇ is Minimizer)

Cutting off 3

<p>[Alpha-Beta Pruning] For the game-tree shown below, state for which values of x the dashed branch with the scissors will be pruned. If the pruning will not happen for any value of x, then it should be "none". If pruning will happen for all values of x, select "all". (Note: Δ is Maximizer, ∇ is Minimizer)</p><p>Cutting off 3</p>
26
New cards

Node4 with value=18

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.

11, 15, 2, 18, 16, 2, 3, 14, 11

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.</p><p>11, 15, 2, 18, 16, 2, 3, 14, 11</p>
27
New cards

Node7 with value=19

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned

13, 14, 16, 14, 3, 12, 19, 13

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned</p><p>13, 14, 16, 14, 3, 12, 19, 13</p>
28
New cards

Node3 with value=10

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.

9, 6, 10, 1, 8, 18

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.</p><p>9, 6, 10, 1, 8, 18</p>
29
New cards

Node4 with value=8

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.

9, 13, 4, 8, 5, 15, 15

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.</p><p>9, 13, 4, 8, 5, 15, 15</p>
30
New cards

Node4 with value=19

[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.

19, 17, 10, 19, 16, 13, 2

<p>[Alpha-Beta] Consider the following minimax tree with alpha-beta pruning, with each leaf node and its value as shown below. Select the first leaf-node to be pruned.</p><p>19, 17, 10, 19, 16, 13, 2</p>