1 files changed, 3 insertions, 3 deletions
diff --git a/TODO.txt b/TODO.txt
index 68f89c5..30ee17f 100644
--- a/TODO.txt
+++ b/TODO.txt
@@ -1,9 +1,9 @@
 ## (find better name) H48 solver, ideas
-TODO next: implement cosep coordinate
+TODO next: epsep, precise coordinate unlike cpsep which is redundant
-First compute co + csep. Use csep as a binary number (2^8 instead of 70,
+First compute co + csep. Use csep as a binary number (2^7 instead of 70,
-loose a factor of 3.66 but still fits in a few megabytes or less). Use
+loose a factor of 1.8 but still fits in a few megabytes or less). Use
 co + csep as an index in a table whose entries have: 6 bits for ttrep,
 12 bits for rep, 4 bits for pruning. Optionally, 4 more bits could be
 used for the base of the pruning table, if we want to have a different

diff --git a/TODO.txt b/TODO.txt index 68f89c5..30ee17f 100644 --- a/TODO.txt +++ b/TODO.txt
@@ -1,9 +1,9 @@
1	## (find better name) H48 solver, ideas	1	## (find better name) H48 solver, ideas
2		2
3	TODO next: implement cosep coordinate	3	TODO next: epsep, precise coordinate unlike cpsep which is redundant
4		4
5	First compute co + csep. Use csep as a binary number (2^8 instead of 70,	5	First compute co + csep. Use csep as a binary number (2^7 instead of 70,
6	loose a factor of 3.66 but still fits in a few megabytes or less). Use	6	loose a factor of 1.8 but still fits in a few megabytes or less). Use
7	co + csep as an index in a table whose entries have: 6 bits for ttrep,	7	co + csep as an index in a table whose entries have: 6 bits for ttrep,
8	12 bits for rep, 4 bits for pruning. Optionally, 4 more bits could be	8	12 bits for rep, 4 bits for pruning. Optionally, 4 more bits could be
9	used for the base of the pruning table, if we want to have a different	9	used for the base of the pruning table, if we want to have a different