Some information about task SCORE In this task, the important thing to discover somehow, is that removal of the starting position yields a directed acyclic graph (DAG). A depth-first search (DFS) rooted at the starting position yields a traversal tree whose back-edges all go to the root. Using a minimax evaluation on that tree gives an optimal strategy in a time linear in the number of edges of the game graph. The 20 test cases were designed by varying the path lengths, node values, and number of edges, such that various non-optimal strategies can be distinguished. The test data was evaluated against random strategies, the 1-step look-ahead greedy strategy, the 2-step look-ahead greedy strategy, and exhaustive game-state evaluation.