Two solvers for finite two-player games: fully-mixed Nash equilibrium for m x n normal-form games via linear programming, and subgame-perfect equilibrium for extensive-form games via backward induction.
Two solvers for finite two-player games: fully-mixed Nash equilibrium for m x n normal-form games via linear programming, and subgame-perfect equilibrium for extensive-form games via backward induction.