diff options
Diffstat (limited to 'TODO.txt')
| -rw-r--r-- | TODO.txt | 25 |
1 files changed, 7 insertions, 18 deletions
| @@ -1,11 +1,12 @@ | |||
| 1 | ## Generic solver | 1 | ## Solving |
| 2 | |||
| 3 | ### Generic solver | ||
| 2 | 4 | ||
| 3 | * finish implementation | ||
| 4 | * tests: solve full cube (max 7-8 moves?) | 5 | * tests: solve full cube (max 7-8 moves?) |
| 5 | * more tests: eo and other stuff | 6 | * more tests: eo and other stuff |
| 6 | * benchmarks | 7 | * benchmarks |
| 7 | 8 | ||
| 8 | ## Coordinates | 9 | ### Coordinates |
| 9 | 10 | ||
| 10 | * [done] eo | 11 | * [done] eo |
| 11 | * co | 12 | * co |
| @@ -17,22 +18,10 @@ | |||
| 17 | 18 | ||
| 18 | What about symcoord? | 19 | What about symcoord? |
| 19 | 20 | ||
| 20 | ## More I/O | 21 | ### More solvers |
| 21 | |||
| 22 | |||
| 23 | ## Solving | ||
| 24 | |||
| 25 | All solving functions take a cube and some parameters as input. | ||
| 26 | 22 | ||
| 27 | * Depth [uint, <= 20]: all solvers work at fixed depth. The caller | 23 | * solve_light: first based on solve_generic, then optimize; benchmark |
| 28 | implementation can implement an A* search. | 24 | to see up to what length it works best (7 moves? 10 moves?) |
| 29 | * max [int]: the maximum number of solutions to find. Set to a negative | ||
| 30 | value for all solutions. | ||
| 31 | * sol [move_t *]: the array for returning the solutions. The caller | ||
| 32 | should make sure that it can hold at least max * depth values. | ||
| 33 | * Table [uint8_t *]: table with all the necessare pre-computed info. | ||
| 34 | The table can be generated with a companion function, but reading | ||
| 35 | from and writing to file is delegated to the caller implementation. | ||
| 36 | 25 | ||
| 37 | ### Implement the following solvers: | 26 | ### Implement the following solvers: |
| 38 | 27 | ||