Thanks for the report! This is fixed now!
TheTastyPi
Recent community posts
FYI: I'm not concerned with just finding a solution, that can be done with manual bruteforce calculations. I was concerned with finding a more "mathematical" approach, which I didn't find (and thus resorted to code). The solution listed in the doc is, however, the shortest solution, which could be considered the "simplest", going by that metric.
As far as I know, I never mention you "ending up with 5 oranges". I said you will have 5 oranges to spare. Which is true, I believe.
This document is mainly for the purpose of documenting logic, and with the compilation of solutions as a side-effect, so I'd appreciate it if you can point out any logical inaccuracies, if any.
Edit: Ah, I see how the wording can be confusing now. I'll change the wording a bit to make my point clearer.
I got really bored one day, so I made a list of my solve paths for each puzzle, and called it:
I Wanna Lockpick ~ PATH OF LOGIC (Part 1)
I pretty much just slapped whatever my thought was when trying to formalize the puzzle into a big list, then tried to organize it a little bit.
It's still a big mess at parts, especially for some of the harder puzzles to formalize.
I might do this for part 2 as well, but that's quite a bit into the future.
(And I assume that the puzzles then will be harder, so... I'm dreading it.)
Edit: A brand new doc has been made for the newly released part 2!
It contains logical analysis for all newly added puzzles in part 2, and as a result, their solution. Enjoy.
I Wanna Lockpick ~ PATH OF LOGIC (Part 2) (also linked in the first doc)