class: "GraphGameTreeTest"
alg: "MinimaxAgent"
depth: "2"

diagram: """
            /-----a------\
           /              \
          /                \
        b1                  b2
         |                /    \
 4.99   cx          8  c3        c4   5
         |            /   \     /   \
        dx           d5   d6   d7   d8
       4.99          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 4.99
d5 4.0
d6 -7.0
d7 0.0
d8 5.0
dx 4.99
"""