Diggita è ora una nuova istanza italiana del #fediverso! 🥳

Il lavoro di configurazione è terminato, è ora possibile iscriversi: diggita.com oppure seguire i gruppi tematici dal proprio account #mastodon:

▶️ @spettacoli

▶️ @internet

▶️ @fediverso

▶️ @tecnologia

▶️ @linux

▶️ @cultura

▶️ @salute

▶️ @diggita@diggita.com

▶️ @economia

▶️ @attualita

▶️ @societa

▶️ @video

▶️ @computer

▶️ @sport

▶️ @opensource

▶️ @astronomia

▶️ @sicurezza

▶️ @scienze

▶️ @ambiente

▶️ @calcio

▶️ @giochi

▶️ @foto

Today in Labor History December 21, 1911: The Bonnot Gang, a group of anarchist bandits, pulled off one of the first bank robberies known to have used an automobile as a getaway car. They did it in broad daylight, in the midst of a populous Paris district. They were also among the first to use repeating rifles, technology that the French police did not yet have. They successfully robbed several banks before being caught and executed. The gang members were anarchist individualists, of the Max Stirner school. They were connected with the anarchist periodical, “L’Anarchie,” edited by Victor Serge, who later participated in the Russian Revolution. Serge was imprisoned by the Bolsheviks and, while in prison, wrote his most famous novel, “Birth of Our Power.” You can read more about the Bonnot Gang in Richard Parry’s book “The Bonnot Gang.”

#workingclass #LaborHistory #anarchism #BonnotGang #VictorSerge #russia #banks #Revolution #prison #books #novel #fiction #author #writer @bookstadon

Day 21 #adventofcode in the books.

Part 1 was to figure out the minimum move sequence to input a code on keypad, with the wrinkle being there were three other keypads above it before the movement was applied to the final keypad.

I wrote a BFS pathfinder for the keypads and then used it to derive all of the minimum paths and use that to find the min length on the first keypad.

Except it would have taken 10 hours to complete. By this point it was headed for 2am and I decided to take the slot machine route and write a bogo function (IE choose a random code at each level and just try that to see if you get lucky). Yeah thats when I knew it was time to pack it in for the night.

Epiphanies I had in the shower this morning:

1. Its basically a weird movement factorial. Factorials respond well to being memoized. So I memoized it.

2. BFS pathfinding on the keypad was massive overkill. You could reduce it to simple linear combinations of x and y movements.

After a complete rewrite taking those into account it finished in milliseconds.

Part 2 took it to stupid levels by making it 25 levels deep. But as luck would have it the way I rewrote my code made this an easy extension.

The only wrinkle here was the sheer size of the number it returned needed a bigint.

Don't know that #typescript was the best for this one, would probably have been easier in #python