no payoff tests for BinaryTreeGames in test_reduced_strategic_form

Author: rahulsavani

tests/games.py

@@ -449,13 +449,7 @@ def gbt_game(self):
         return g
 
     def reduced_strategic_form(self):
-        # special case for 1 player
-        dims = (
-            (self.size_of_rsf[0], 1) if len(self.size_of_rsf) == 1 else self.size_of_rsf
-        )
-
-        zeros = np.zeros(dims, dtype=int)
-        return [zeros] * len(self.players)
+        return None
 
 
 class BinEfgOnePlayerIR(BinaryTreeGames):

tests/test_extensive.py

@@ -487,7 +487,7 @@ def test_outcome_index_exception_label():
     ],
 )
 def test_reduced_strategic_form(
-    game: gbt.Game, strategy_labels: list, np_arrays_of_rsf: list
+    game: gbt.Game, strategy_labels: list, np_arrays_of_rsf: typing.Union[list, None]
 ):
     """
     We test two things:
@@ -499,6 +499,7 @@ def test_reduced_strategic_form(
 
     for i, player in enumerate(game.players):
         assert strategy_labels[i] == [s.label for s in player.strategies]
-        # convert strings to rationals
-        exp_array = games.vectorized_make_rational(np_arrays_of_rsf[i])
-        assert (arrays[i] == exp_array).all()
+        if np_arrays_of_rsf is not None:
+            # convert strings to rationals
+            exp_array = games.vectorized_make_rational(np_arrays_of_rsf[i])
+            assert (arrays[i] == exp_array).all()