Skip to content

Commit 2cfa8a1

Browse files
committed
removed create_problem_example_efg from games.py
1 parent 00b28c3 commit 2cfa8a1

1 file changed

Lines changed: 0 additions & 13 deletions

File tree

tests/games.py

Lines changed: 0 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -788,19 +788,6 @@ def create_reduction_both_players_payoff_ties_efg() -> gbt.Game:
788788
return g
789789

790790

791-
def create_problem_example_efg() -> gbt.Game:
792-
g = gbt.Game.new_tree(players=["1", "2"], title="")
793-
g.append_move(g.root, player="1", actions=["L", "R"])
794-
# do the second child first on purpose to diverge from sort infosets order
795-
g.append_move(g.root.children[1], "2", actions=["l2", "r2"])
796-
g.append_move(g.root.children[0], "2", actions=["l1", "r1"])
797-
g.set_outcome(g.root.children[0].children[0], outcome=g.add_outcome(payoffs=[5, -5]))
798-
g.set_outcome(g.root.children[0].children[1], outcome=g.add_outcome(payoffs=[2, -2]))
799-
g.set_outcome(g.root.children[1].children[0], outcome=g.add_outcome(payoffs=[-5, 5]))
800-
g.set_outcome(g.root.children[1].children[1], outcome=g.add_outcome(payoffs=[-2, 2]))
801-
return g
802-
803-
804791
def create_two_player_perfect_info_win_lose_efg(nonterm_outcomes: bool = False) -> gbt.Game:
805792
g = gbt.Game.new_tree(players=["1", "2"], title="2 player perfect info win lose")
806793
g.append_move(g.root, "2", ["a", "b"])

0 commit comments

Comments
 (0)