The directory structure of the program has been updated. Instead of keeping everything in ~git/magic-tape/, now various files and directories are kept in various places.This way,
the magic-tape.sh is in ~/.local/bin/
the magic-tape cache files are all in ~/.cache/magic-tape/
the configuration text file will be created in ~/.config/magic-tape/
The action selection can be either with rofi, or fzf (if the user wants to go full TUI).This can be configured during the P option of the misc menu.
So if you want to go full tui, you can avoid rofi and go full fzf.
Thanks! It don't see why not is not doable, writing out the found data from the C script to a file,parse the file to get the value of each square. From there, either create a label for each square and rewrite the whole puzzle with append, or fill with layers. This might work.
I think that apart from not installing the dependencies, both problems that you have faced in your machine (zsh-bash conflict, headless machine) are beyond the scope of this script and need to be examined individually.
At the end of the day, one could easily substitute rofi with fzf itself in the script, they do more or less the same job. I am not certain rofi is your main obstacle here.
I remember last year for 2 to 3 months, I was swimming in deep C language ( I was-and still am- a novice), initially starting to build the solver. From there, I moved on to create a sudoku generator, and finally to a sudoku game program, all in C.
Perhaps a right way forward for you is to go backwards. While you know what you want, get a solved riddle, and then with your condition in mind, move backwards, taking out the numbers that fall into that condition, and thus create an interesting, for you at least, riddle.
Finally, when you have walked the algorithm yourself, it is time to code.
It seems a great but fascinating task.
I always think that in every impossible and unsolvable riddle, there is a logical way forward that escapes me. And while reductio ad absurdum is an inferior, weak and low-level logical method, it remains a logical method nonetheless, that in the end of the day, gets the job done.
By guessing I imagine that you refer to the situation when you reach a point, where all logic paths are a dead-end; all except one: reductio ad absurdum, or apagogical statememt. In this case you claim (guess) that a square has a specific, and begin to solve the rest as if that claim was valid. If things work, all is well, if not you prove that claim invalid, go back and start with an alternative value.
I am not that deep into sudoku solving to make a script to generate sudoku riddles that do or don't include this logic method. This script only brute forces all possible combinations, until it reaches the solution.
I have no clue how that could be coded but I’d like to learn how to approach such a problem
You can open the P option by either double-clicking on it with the mouse, or entering capital P with the keyboard. You can get to select the P option through the misc menu.
Do you get any error messages when doing so?
Have you installed all the dependencies of the script (rofi in particular)?
I have made some updates that may concern you:
UPDATES:
~git/magic-tape/, now various files and directories are kept in various places.This way,magic-tape.shis in~/.local/bin/~/.cache/magic-tape/~/.config/magic-tape/rofi, orfzf(if the user wants to go full TUI).This can be configured during the P option of the misc menu.So if you want to go full tui, you can avoid
rofiand go fullfzf.Let me know how it goes if you try.