Notes
This function is in beta test. Please help improve it in the issues
here.
Hints
Your answer may be identical to the JOJ answer in the first several lines.
However, you will still get Wrong Answer because the complete output may be longer and there might be errors in the future lines.
Please double check your code to solve this problem and try again.
Your Answer
*** FAIL: ./test_cases/q3/2-4a-vary-depth.test *** Incorrect move for depth=1 *** Student move: Left *** Optimal move: Right *** Incorrect generated nodes for depth=1 *** Student generated nodes: a b1 b2 c3 c4 cx d5 d6 d7 d8 dx *** Correct generated nodes: a b1 b2 c3 c4 cx *** Tree: *** /-----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.
JOJ Answer
*** PASS: ./test_cases/q3/2-4a-vary-depth.test