I am proud to present the clipboardstealer, written in #rust (which is a clipboardmanager for the #terminal in an #X11 / #xwayland environment in #linux). It can be found at crates.io/crates/clipb... . Let me know what you think. #clipboardmanager
Let's have some fun with #fft ( #fastfouriertransform ) in the programming language #R :
Between all this #AdventOfCode and #projecteuler stuff we must not forget also to chill out a bit.
www.youtube.com/watch?v=TCIQ...
#AdventOfCode #ProjectEuler I just finished projecteuler.net/problem=68
This stuff was completely new to me. And it was the hardest task for me in 12/2025 so far. But I learned a lot. Also about continued fractions. It is amazing what others already discovered hundreds of years ago.
#AdventOfCode #ProjectEuler I just finished projecteuler.net/problem=66
One Idea has maybe a chance under certain circumstances. You calculate the density ( tiles to set / area) and by constructing you try to keep the density consistent over the construction steps. This reduces the search space a lot.
Also a good approach is the tetris approach: bsky.app/profile/fran...
I wasted 2 days in bin packing research before I saw the same solution like you. But I think some ideas I've found aren't bad. For instance what about looking for pairs of packed shapes and an appropriate estimation of the density and then trying to combine the packed shapes further recursively.
Now that the #AdventOfCode is over, its time to chill out a little bit.
www.youtube.com/watch?v=YTDD...
#AdventOfCode adventofcode.com/2025/day/12 the aftermath
I just completed all 12 days of Advent of Code 2025! #AdventOfCode adventofcode.com
I just completed "Reactor" - Day 11 - Advent of Code 2025 #AdventOfCode adventofcode.com/2025/day/11
... And allowed me to find the minimum allowed SUM.
That worked. But the interesting part was: I was able to use the precalculated SUM - range from clpfd to find the lowest number where a Z3 calculation was no longer unsat. Even when clpfd was not able to complete the formula as a whole it was able to restrict the allowed range of the SUM variable.
Then I thought I switch to a solver in Swi Prolog : clpfd. The example data were processed even faster but only some of the input data I was able to process. Some were just too slow. After a while I decided to connect via the janus library from prolog to python and use Z3 there.
Some words to #AdventOfCode adventofcode.com/2025/day/10 Part 2.
First I tried to use a prolog typical BFS by increasing a depth variable and limiting all sub calculations by creating a sum which is that depth. It worked after enabling tabling. But it wasn't enough for tie input data. ...
I just completed "Factory" - Day 10 - Advent of Code 2025 #AdventOfCode adventofcode.com/2025/day/10
I solved the task of day 8 in prolog and after that I wrote the start data and some data during the calculation in separate files which I then read into an R program. The visualization in R is made with the rgl library. Thanks for the kudos.
#AdventOfCode adventofcode.com/2025/day/8 : the aftermath
I just completed "Movie Theater" - Day 9 - Advent of Code 2025 #AdventOfCode adventofcode.com/2025/day/9
I just completed "Playground" - Day 8 - Advent of Code 2025 #AdventOfCode adventofcode.com/2025/day/8
And here is all the #AdventOfCode - Code : github.com/schwidom/Adv...
I just completed "Laboratories" - Day 7 - Advent of Code 2025 #AdventOfCode adventofcode.com/2025/day/7
I just completed "Trash Compactor" - Day 6 - Advent of Code 2025 #AdventOfCode adventofcode.com/2025/day/6
