From 7b48583d629d33971e9f1d5e7aa4ca7f11d8a032 Mon Sep 17 00:00:00 2001
From: Sebastiano Tronto <sebastiano@tronto.net>
Date: Mon, 6 Nov 2023 22:59:21 +0100
Subject: Started working on solve

---
 README.md | 12 ++++++++++--
 1 file changed, 10 insertions(+), 2 deletions(-)

(limited to 'README.md')

diff --git a/README.md b/README.md
index 383b50c..505b840 100644
--- a/README.md
+++ b/README.md
@@ -37,6 +37,12 @@ for benchmarks.
 
 ## TODO:
 
+### Simple solver
+
+* tests
+* finish implementation
+* benchmarks
+
 ### Coordinates
 
 * [done] eo
@@ -55,8 +61,10 @@ 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.
-* Full [bool]: if false, stop at first solution found, otherwise
-  find all solutions at that depth.
+* 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.
-- 
cgit v1.3