blob: cbe88b59e12940f243689aa6febfbc1c2de3a58d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
class: "GraphGameTreeTest"
alg: "MinimaxAgent"
depth: "2"
diagram: """
/-----a------\
/ \
/ \
b1 b2
| / \
5.01 cx 8 c3 c4 5
| / \ / \
dx d5 d6 d7 d8
5.01 4 -7 0 5
a - max
b - min
c - max
Note that the minimax value of b1 is 4, but the depth=1 limited value is 5.
The values next to c3, c4, and cx are the values of the evaluation function, not
necessarily the correct minimax backup.
"""
num_agents: "2"
start_state: "a"
win_states: "d1 d2 d3 d4 d5 d6 d7 d8 dx"
lose_states: ""
successors: """
a Left b1
a Right b2
b1 Down cx
b2 Left c3
b2 Right c4
c3 Left d5
c3 Right d6
c4 Left d7
c4 Right d8
cx Down dx
"""
evaluation: """
c3 8.0
c4 5.0
cx 5.01
d5 4.0
d6 -7.0
d7 0.0
d8 5.0
dx 5.01
"""
|
