84 lines
1.1 KiB
Plaintext
84 lines
1.1 KiB
Plaintext
|
class: "GraphGameTreeTest"
|
||
|
alg: "AlphaBetaAgent"
|
||
|
depth: "1"
|
||
|
|
||
|
diagram: """
|
||
|
a
|
||
|
/-/ | \--\
|
||
|
/ | \
|
||
|
0 b1 0 b2 b3 8
|
||
|
| | |
|
||
|
10 c1 0 c2 c3 8
|
||
|
| | |
|
||
|
0 d1 0 d2 d3 8
|
||
|
| | |
|
||
|
0 e1 10 e2 e3 8
|
||
|
| | |
|
||
|
0 f1 0 f2 f3 8
|
||
|
| | |
|
||
|
g1 g2 g3
|
||
|
0 0 8
|
||
|
|
||
|
a - max
|
||
|
b - min
|
||
|
c - max
|
||
|
d - min
|
||
|
e - max
|
||
|
f - min
|
||
|
|
||
|
At depth 1, the evaluation function is called at level c,
|
||
|
so Left should be returned. If your algorithm is returning a
|
||
|
different action, check how you implemented your depth.
|
||
|
"""
|
||
|
|
||
|
num_agents: "2"
|
||
|
|
||
|
start_state: "a"
|
||
|
win_states: "g1 g2 g3"
|
||
|
lose_states: ""
|
||
|
|
||
|
successors: """
|
||
|
a Left b1
|
||
|
a Center b2
|
||
|
a Right b3
|
||
|
b1 Center c1
|
||
|
b2 Center c2
|
||
|
b3 Center c3
|
||
|
c1 Center d1
|
||
|
c2 Center d2
|
||
|
c3 Center d3
|
||
|
d1 Center e1
|
||
|
d2 Center e2
|
||
|
d3 Center e3
|
||
|
e1 Center f1
|
||
|
e2 Center f2
|
||
|
e3 Center f3
|
||
|
f1 Center g1
|
||
|
f2 Center g2
|
||
|
f3 Center g3
|
||
|
"""
|
||
|
|
||
|
|
||
|
evaluation: """
|
||
|
b1 0.0
|
||
|
b2 0.0
|
||
|
b3 8.0
|
||
|
c1 10.0
|
||
|
c2 0.0
|
||
|
c3 8.0
|
||
|
d1 0.0
|
||
|
d2 0.0
|
||
|
d3 8.0
|
||
|
e1 0.0
|
||
|
e2 10.0
|
||
|
e3 8.0
|
||
|
f1 0.0
|
||
|
f2 0.0
|
||
|
f3 8.0
|
||
|
g1 0.0
|
||
|
g2 0.0
|
||
|
g3 8.0
|
||
|
"""
|
||
|
|
||
|
|