From 5bdf6e73179cf944ce82606545beb0b0d63a59a3 Mon Sep 17 00:00:00 2001
From: Sebastiano Tronto <sebastiano@tronto.net>
Date: Wed, 8 Nov 2023 18:53:00 +0100
Subject: Improved comments

---
 TODO.txt | 25 +++++++------------------
 1 file changed, 7 insertions(+), 18 deletions(-)

(limited to 'TODO.txt')

diff --git a/TODO.txt b/TODO.txt
index 6e000ad..8add9cc 100644
--- a/TODO.txt
+++ b/TODO.txt
@@ -1,11 +1,12 @@
-## Generic solver
+## Solving
+
+### Generic solver
 
-* finish implementation
 * tests: solve full cube (max 7-8 moves?)
 * more tests: eo and other stuff
 * benchmarks
 
-## Coordinates
+### Coordinates
 
 * [done] eo
 * co
@@ -17,22 +18,10 @@
 
 What about symcoord?
 
-## More I/O
-
-
-## Solving
+### More solvers
 
-All solving functions take a cube and some parameters as input.
-
-* Depth [uint, <= 20]: all solvers work at fixed depth. The caller
-  implementation can implement an A* search.
-* max [int]: the maximum number of solutions to find. Set to a negative
-  value for all solutions.
-* sol [move_t *]: the array for returning the solutions. The caller
-  should make sure that it can hold at least max * depth values.
-* Table [uint8_t *]: table with all the necessare pre-computed info.
-  The table can be generated with a companion function, but reading
-  from and writing to file is delegated to the caller implementation.
+* solve_light: first based on solve_generic, then optimize; benchmark
+  to see up to what length it works best (7 moves? 10 moves?)
 
 ### Implement the following solvers:
 
-- 
cgit v1.3