X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=src%2Fdunshire%2Fgames.py;h=80f5f8ae2a46d09f15e34546c511edeca286f4fa;hb=dd98bb15beba1e9eae310598e1b55a7dd9d4aa01;hp=43fa007c61077c90ef627e9738afbaa09dcde9c1;hpb=fa8fa4d690c5f30f7d5fee1818a9b4c15f52c5ff;p=dunshire.git

diff --git a/src/dunshire/games.py b/src/dunshire/games.py
index 43fa007..80f5f8a 100644
--- a/src/dunshire/games.py
+++ b/src/dunshire/games.py
@@ -445,7 +445,7 @@ class SymmetricLinearGame:
         # worst, since they indicate that CVXOPT is convinced the
         # problem is infeasible (and that cannot happen).
         if soln_dict['status'] in ['primal infeasible', 'dual infeasible']:
-            raise GameUnsolvableException(soln_dict)
+            raise GameUnsolvableException(self, soln_dict)
         elif soln_dict['status'] == 'unknown':
             # When we get a status of "unknown", we may still be able
             # to salvage a solution out of the returned
@@ -455,9 +455,9 @@ class SymmetricLinearGame:
             # primal/dual optimal solutions are within the cone (to a
             # tolerance as well).
             if abs(p1_value - p2_value) > options.ABS_TOL:
-                raise GameUnsolvableException(soln_dict)
+                raise GameUnsolvableException(self, soln_dict)
             if (p1_optimal not in self._K) or (p2_optimal not in self._K):
-                raise GameUnsolvableException(soln_dict)
+                raise GameUnsolvableException(self, soln_dict)
 
         return Solution(p1_value, p1_optimal, p2_optimal)