X-Git-Url: http://gitweb.michael.orlitzky.com/?p=dunshire.git;a=blobdiff_plain;f=TODO;h=e8bf9e55b3f09348b157b6dd295fb18442542cbc;hp=2fe7ea4eab6b3fc44b571c8dcdb1272c6a4e153e;hb=d90b0b66e1983af5268fb1784907004e12b48dfa;hpb=5a78134ba154ef2e4855b791d1bdb45f26bfdf57

diff --git a/TODO b/TODO
index 2fe7ea4..e8bf9e5 100644
--- a/TODO
+++ b/TODO
@@ -7,6 +7,3 @@
 
 4. Come up with a fast heuristic (like making nu huge and taking e1 as
    our point) that finds a primal feasible point.
-
-5. Add a test to ensure that if we solve the same game twice, we get the
-   same answer back.