|
2 | 2 |
|
3 | 3 | ## [16.5.0] - unreleased |
4 | 4 |
|
| 5 | +### Fixed |
| 6 | +- Sequence-form based equilibrium-finding methods returned incorrect output on games with |
| 7 | + outcomes at non-terminal nodes. (#654) |
5 | 8 | ### Added |
6 | 9 | - Implement `IsAbsentMinded()` on information sets (C++) and `Infoset.is_absent_minded` (Python) |
7 | 10 | to detect if an information is absent-minded. |
| 11 | +- Tests for EFG Nash solvers -- `enumpoly_solve`, `lp_solve`, `lcp_solve` -- in behavior stratgegies |
| 12 | +- In `pygambit`, `Node` objects now have a read-only property `own_prior_action` and `Infoset` objects |
| 13 | + have a read-only property `own_prior_actions` to retrieve the last action or the set of last actions |
| 14 | + taken by the player before reaching the node or information set, respectively. (#582) |
| 15 | +- In `pygambit`, `Node` objects now have a read-only property `is_strategy_reachable` to determine |
| 16 | + if the node is reachable by at least one pure strategy profile. This proves useful for identifying |
| 17 | + unreachable parts of the game tree in games with absent-mindedness. (#629) |
8 | 18 |
|
9 | 19 | ### Changed |
10 | 20 | - In the graphical interface, removed option to configure information set link drawing; information sets |
|
14 | 24 | - In `pygambit`, `min_payoff` and `max_payoff` (for both games and players) now refers to payoffs in |
15 | 25 | any play of the game; previously this referred only to the set of outcomes. (#498) |
16 | 26 |
|
17 | | -### Added |
18 | | -- Tests for EFG Nash solvers -- `enumpoly_solve`, `lp_solve`, `lcp_solve` -- in behavior stratgegies |
19 | | -- In `pygambit`, `Node` objects now have a read-only property `own_prior_action` and `Infoset` objects |
20 | | - have a read-only property `own_prior_actions` to retrieve the last action or the set of last actions |
21 | | - taken by the player before reaching the node or information set, respectively. (#582) |
22 | | -- In `pygambit`, `Node` objects now have a read-only property `is_strategy_reachable` to determine |
23 | | - if the node is reachable by at least one pure strategy profile. This proves useful for identifying |
24 | | - unreachable parts of the game tree in games with absent-mindedness. (#629) |
25 | | - |
26 | 27 | ### Removed |
27 | 28 | - Eliminating dominated actions has been removed from the GUI as it was implementing a non-standard |
28 | 29 | formulation of dominance. (#612) |
|
0 commit comments