|
2 | 2 | import pytest |
3 | 3 |
|
4 | 4 | import pygambit as gbt |
5 | | -from pygambit import Rational |
6 | 5 |
|
7 | 6 | from . import games |
8 | 7 |
|
|
34 | 33 | games.read_from_file("e01.efg"), |
35 | 34 | [["1", "2"], ["1", "2"], ["1", "2"]], |
36 | 35 | [ |
37 | | - np.array( |
38 | | - [ |
39 | | - [ |
40 | | - [Rational(1, 1), Rational(1, 1)], |
41 | | - [Rational(4, 1), Rational(0, 1)], |
42 | | - ], |
43 | | - [ |
44 | | - [Rational(3, 1), Rational(0, 1)], |
45 | | - [Rational(3, 1), Rational(0, 1)], |
46 | | - ], |
47 | | - ] |
48 | | - ), |
49 | | - np.array( |
50 | | - [ |
51 | | - [ |
52 | | - [Rational(1, 1), Rational(1, 1)], |
53 | | - [Rational(4, 1), Rational(0, 1)], |
54 | | - ], |
55 | | - [ |
56 | | - [Rational(2, 1), Rational(0, 1)], |
57 | | - [Rational(2, 1), Rational(0, 1)], |
58 | | - ], |
59 | | - ] |
60 | | - ), |
61 | | - np.array( |
62 | | - [ |
63 | | - [ |
64 | | - [Rational(1, 1), Rational(1, 1)], |
65 | | - [Rational(0, 1), Rational(1, 1)], |
66 | | - ], |
67 | | - [ |
68 | | - [Rational(2, 1), Rational(0, 1)], |
69 | | - [Rational(2, 1), Rational(0, 1)], |
70 | | - ], |
71 | | - ] |
72 | | - ), |
| 36 | + np.array([[["1", "1"], ["4", "0"]], [["3", "0"], ["3", "0"]]]), |
| 37 | + np.array([[["1", "1"], ["4", "0"]], [["2", "0"], ["2", "0"]]]), |
| 38 | + np.array([[["1", "1"], ["0", "1"]], [["2", "0"], ["2", "0"]]]), |
73 | 39 | ], |
74 | 40 | ), |
75 | 41 | # Myerson 2-card poker; game with chance node |
@@ -118,7 +84,7 @@ def test_reduced_strategic_form( |
118 | 84 | ): |
119 | 85 | """ |
120 | 86 | We test two things: |
121 | | - - that the stratgegy labels are as expected |
| 87 | + - that the strategy labels are as expected |
122 | 88 | (these use positive integers and *'s', rather than labels of moves even if they exist) |
123 | 89 | - that the payoff tables are correct, which is done via game.to_arrays() |
124 | 90 | """ |
|
0 commit comments