Minimax is an algorithm for two-player games where you maximize your score while the opponent minimizes it. On graphs with vertex weights, minimax assigns a value to each position. The max player picks the move with maximum successor value.
The min player picks the minimum. This extends win/loss analysis to games with numeric outcomes. Terminal positions have predefined values, and you propagate values backward.