Print the game data along with every GameUnsolvableException.

[dunshire.git] / TODO

diff --git a/TODO b/TODO
index 6b2a90a76c1d059ed3fbc2ddd35491650996f9e0..d23728e534602656da527a224820370d1152da2d 100644 (file)
--- a/TODO
+++ b/TODO
@@ -7,12 +7,8 @@
 4. Make it work on a cartesian product of cones in the wrong order
    (apply a perm utation before/after).
 
-5. Rename all of my variables so that they don't conflict with CVXOPT.
-   Maybe x -> xi and y -> gamma in my paper, if that works out.
+5. Make sure we have the dimensions of the PSD cone correct.
 
-6. Make sure we have the dimensions of the PSD cone correct.
-
-7. Come up with a fast heuristic (like making nu huge and taking e1 as
+6. Come up with a fast heuristic (like making nu huge and taking e1 as
    our point) that finds a primal feasible point.
 
-8. Should our one exception also spit out the game parameters?