Re:SQL query to generate the Mandelbrot set as ASCII art
by Retric on Saturday February 22, 2020 @01:39AM
(#22389752)
There are 9! × 722 × 27 × 27,704,267,971 valid puzzles but you can drop that to a 722 × 27 × 27,704,267,971 constant look up table by using a strict ordering rather than storing equivalent solutions in different cells.
Basically there is only one unique solution to the top row under a different strict ordering. But, you can do a related mapping for a given problem to reduce the table by 9!.
Basically there is only one unique solution to the top row under a different strict ordering. But, you can do a related mapping for a given problem to reduce the table by 9!.