Added two_player_perfect_info_win_lose_efg_nonterminal_outcomes test

Author: StephenPasteris

tests/games.py

@@ -682,6 +682,25 @@ def create_two_player_perfect_info_win_lose_efg() -> gbt.Game:
     return g
 
 
+def create_two_player_perfect_info_win_lose_efg_nonterminal_outcomes() -> gbt.Game:
+    g = gbt.Game.new_tree(players=["1", "2"], title="2 player perfect info win lose")
+    g.append_move(g.root, "2", ["a", "b"])
+    g.append_move(g.root.children[0], "1", ["L", "R"])
+    g.append_move(g.root.children[1], "1", ["L", "R"])
+    g.append_move(g.root.children[0].children[0], "2", ["l", "r"])
+    g.set_outcome(g.root.children[0], g.add_outcome([0, 0], label="a"))
+    g.set_outcome(
+        g.root.children[0].children[0].children[0], g.add_outcome([1, -1], label="aLl")
+    )
+    g.set_outcome(
+        g.root.children[0].children[0].children[1], g.add_outcome([-1, 1], label="aLr")
+    )
+    g.set_outcome(g.root.children[0].children[1], g.add_outcome([1, -1], label="aR"))
+    g.set_outcome(g.root.children[1].children[0], g.add_outcome([1, -1], label="bL"))
+    g.set_outcome(g.root.children[1].children[1], g.add_outcome([-1, 1], label="bR"))
+    return g
+
+
 def create_EFG_for_nxn_bimatrix_coordination_game(n: int) -> gbt.Game:
     A = np.eye(n, dtype=int)
     B = A

tests/test_nash.py

@@ -432,6 +432,11 @@ def test_lp_behavior_double():
             games.create_two_player_perfect_info_win_lose_efg(),
             [[[0, 1], [1, 0]], [[1, 0], [1, 0]]],
         ),
+        pytest.param(
+            games.create_two_player_perfect_info_win_lose_efg_nonterminal_outcomes(),
+            [[[0, 1], [1, 0]], [[1, 0], [1, 0]]],
+            marks=pytest.mark.xfail(reason="Problem with nonterminal nodes in LP/LCP")
+        ),
         (
             games.create_stripped_down_poker_efg(),
             [[[1, 0], ["1/3", "2/3"]], [["2/3", "1/3"]]],