31 lines
462 B
Plaintext
31 lines
462 B
Plaintext
class: "GraphGameTreeTest"
|
|
alg: "MinimaxAgent"
|
|
depth: "2"
|
|
|
|
diagram: """
|
|
root
|
|
/ \
|
|
lose1 lose2
|
|
0 1
|
|
|
|
If your algorithm is returning a different
|
|
action, make sure you are calling the
|
|
evaluation function on losing states.
|
|
"""
|
|
num_agents: "2"
|
|
|
|
start_state: "root"
|
|
win_states: ""
|
|
lose_states: "lose1 lose2"
|
|
|
|
successors: """
|
|
root Left lose1
|
|
root Right lose2
|
|
"""
|
|
|
|
evaluation: """
|
|
lose1 0.0
|
|
lose2 1.0
|
|
"""
|
|
|