class: "GraphGameTreeTest"
alg: "MinimaxAgent"
depth: "1"

diagram: """
            /-----a------\
           /              \
          /                \
        b1                  b2
      /    \                 |
-4 c1        c2 9           cx -4.01
  /  \      /  \             |
 d1   d2  d3   d4           dx
-3    -9  10    6         -4.01

a - max
b - min
c - max

Note that the minimax value of b1 is -3, but the depth=1 limited value is -4.
The values next to c1, c2, 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 dx"
lose_states: ""

successors: """
a Left b1
a Right b2
b1 Left c1
b1 Right c2
b2 Down cx
c1 Left d1
c1 Right d2
c2 Left d3
c2 Right d4
cx Down dx
"""

evaluation: """
c1 -4.0
c2 9.0
cx -4.01
d1 -3.0
d2 -9.0
d3 10.0
d4 6.0
dx -4.01
"""