Skip to content

Commit

Permalink
Debugging CI segfault in test suite
Browse files Browse the repository at this point in the history
  • Loading branch information
tturocy committed May 23, 2024
1 parent 8da0a12 commit f96257c
Showing 1 changed file with 14 additions and 14 deletions.
28 changes: 14 additions & 14 deletions tests/test_nash.py
Original file line number Diff line number Diff line change
Expand Up @@ -121,10 +121,10 @@ def test_gnm_strategy(self):
result = gbt.nash.gnm_solve(self.poker)
assert len(result.equilibria) == 1

# def test_logit_strategy(self):
# """Test calls of logit for mixed strategy equilibria."""
# result = gbt.nash.logit_solve(self.poker, use_strategic=True)
# assert len(result.equilibria) == 1
def test_logit_strategy(self):
"""Test calls of logit for mixed strategy equilibria."""
result = gbt.nash.logit_solve(self.poker, use_strategic=True)
assert len(result.equilibria) == 1

# def test_logit_behavior(self):
# """Test calls of logit for mixed behavior equilibria."""
Expand All @@ -133,13 +133,13 @@ def test_gnm_strategy(self):


# def test_logit_zerochance():
# """Test handling zero-probability information sets when computing QRE."""
# g = gbt.Game.new_tree(["Alice"])
# g.append_move(g.root, g.players.chance, ["A", "B", "C"])
# g.set_chance_probs(g.players.chance.infosets[0], [0, 0, 1])
# g.append_move(g.root.children[0], "Alice", ["A", "B"])
# g.append_infoset(g.root.children[1], g.root.children[0].infoset)
# win = g.add_outcome([1])
# g.set_outcome(g.root.children[0].children[0], win)
# result = gbt.nash.logit_solve(g, use_strategic=False, maxregret=0.0001)
# assert result.equilibria[0].max_regret() < 0.0001
# """Test handling zero-probability information sets when computing QRE."""
# g = gbt.Game.new_tree(["Alice"])
# g.append_move(g.root, g.players.chance, ["A", "B", "C"])
# g.set_chance_probs(g.players.chance.infosets[0], [0, 0, 1])
# g.append_move(g.root.children[0], "Alice", ["A", "B"])
# g.append_infoset(g.root.children[1], g.root.children[0].infoset)
# win = g.add_outcome([1])
# g.set_outcome(g.root.children[0].children[0], win)
# result = gbt.nash.logit_solve(g, use_strategic=False, maxregret=0.0001)
# assert result.equilibria[0].max_regret() < 0.0001

0 comments on commit f96257c

Please sign in to comment.