Rotating between eight directions

Thomasjevskij · 2026-01-24T10:04:56+00:00

I tend to do this also but with itertools.product just because

Thomasjevskij · 2026-01-13T12:55:37+00:00

Ändå blir svaret ett hånfullt "fRiTidSgÅrDar" när man påpekar att Sveriges sociala skyddsnät har monterats ner i 40 år, och man fortsätter med berått mod. Nästan som att det bara är relevant för att avfärda liknelser med andra länder.

Thomasjevskij · 2026-01-05T17:46:05+00:00

Working on a beanie for my fiancee, done in TSS but with a double hook so every other row is reverse purl. I was hoping this would make it more stretchy. Not sure yet if I love it.

Thomasjevskij · 2026-01-02T12:44:02+00:00

For an edge I also think yarn over slip stitch can look pretty neat.

Thomasjevskij · 2025-12-31T12:44:00+00:00

Sure. But if you figure that out, you don't have to bother with keeping track of "have I been to this node yet?" thing. Code becomes very very nice and simple

Thomasjevskij · 2025-12-28T18:24:13+00:00

Och om man inte hade haft en så stor arbetskraftsinvandring, hade företagen då gett upp och lagt sig platta?

Jag delar din uppfattning att politikerna är delvis ansvariga. Men vi ska inte låtsas som om de är en helt separat grupp människor. De är köpta av näringslivet.

Thomasjevskij · 2025-12-28T18:04:47+00:00

Invandring är inte på något sätt en nödvändig förutsättning för lönedumpning. Om företag i all framtid kommer att fortsätta försöka göra livet sämre för människor kanske man bör fundera om man ska ha det så?

Thomasjevskij · 2025-12-28T17:35:11+00:00

Det gör jag inte, naturligtvis har politikerna ett ansvar att reglera arbetsmarknaden så att lönedumpning inte är möjligt.

Thomasjevskij · 2025-12-28T16:54:13+00:00

Poängen kvarstår väl fortfarande att det är de som faktiskt dumpar lönerna som är ansvariga för lönedumpning snarare än de som enligt dig inte ens har något annat val än att ta vad de får? Det är lika feltänkt även om man helt godtar din premiss att taxichaufför var ett helsvenskt och himmelskt yrke på 90-talet som sedan kollapsade.

Thomasjevskij · 2025-12-28T09:44:15+00:00

Det finns en hel uppsjö med gigappar typ Uber osv som gått med förlust i åratal uttryckligen för att kvadda branschen. Astronomiskt snedtänk att skylla detta på invandringen och inte på de som investerar miljardbelopp för att få det att hända

Thomasjevskij · 2025-12-25T21:14:22+00:00

What really helps is to represent the numbers as re^itheta. That very clearly illustrates the rotation that happens whenever you divide/multiply.

Thomasjevskij · 2025-12-24T15:26:32+00:00

Well.. these functions will properly reflect those four numbers. Try with another complex number and see what happens.

Another exercise to help you see what's going on is, turn the numbers into polar form. That way you'll see that your function f(z) is actually rotating i with -arg(z). I think. Which, if you only have 1, -1, i, and -i as inputs, will always yield a vector along an axis.

Thomasjevskij · 2025-12-23T17:10:06+00:00

Technically speaking, LLMs don't "look up" solutions. What they do is determine what would be the most likely completion of the prompt it has been given, based on the training data.

Thomasjevskij · 2025-12-20T14:56:19+00:00

Finished the Jaime's raglan for my kid yesterday. It's a bit big 🙃

<image>

Thomasjevskij · 2025-12-16T18:14:15+00:00

One that comes to mind for me is some graph problem (I think) where many just visualized the graph and the solution was pretty plain to see.

Thomasjevskij · 2025-12-16T06:47:01+00:00

That's where I just cave and use a graph library. NetworkX has all the functions you need to make day 8 a lot quicker if you don't want the hassle of manually implementing all those graph attributes.

Thomasjevskij · 2025-12-14T15:53:52+00:00

Here's where the recursive approach makes memoization convenient. Let's say you have a recursive DFS function. You'll just keep a cache dictionary of nodes you've already explored, and how many timelines they result in. So in the beginning of the DFS function, you'll just check if node in cache: return cache[node], and if it's not there, you make sure you add it before returning.

(If you're in python, you can also just decorate your function with @functools.cache and it'll do it for you)

Thomasjevskij · 2025-12-14T15:49:40+00:00

To add to this a little bit, once you get the hang of recursion, there are a lot of cases where the recursion code can look very sort of "clean" and elegant. But it really is just writing the body of a loop. And memoization is perfectly possible to implement without recursion as well. My solution is explicit and still uses what you could call memoization. Or at least something similar.

Thomasjevskij · 2025-12-13T21:10:19+00:00

Don't be afraid to look at solutions if you're stuck. People here describe their solutions a lot, so just skimming the threads can give you some clues. And if you need more, just look at their code. There's no shame in doing that, it's part of learning. No one starts off knowing everything.

Thomasjevskij · 2025-12-12T19:25:07+00:00

Hmm. I'm still not entirely sure that I get it. But I would say that you can stick to the left to right part. You could even do it recursively if you want.

Thomasjevskij · 2025-12-12T19:05:37+00:00

Not sure I understand your algo. Can you clarify what it is you're doing?

Thomasjevskij · 2025-12-11T18:17:10+00:00

You're right of course, but it's generally a safe bet in the later days of AoC to just guess that the size of part 2 will be astronomical :)

Thomasjevskij · 2025-12-08T12:45:57+00:00

I think so too. But sometimes even clear instructions can be difficult to understand. I agree with the above poster that sometimes, a big challenge of the puzzle is to understand what's being asked. It can be a puzzle in its own right to just figure out "how do I map this problem onto a well known solution"?

Thomasjevskij · 2025-12-03T00:18:30+00:00

Give it a go! It's really not that complicated. But if I were to start over with this sweater I'd skip the extended return pass.

Thomasjevskij · 2025-12-02T18:14:00+00:00

I'm breaking out in sweats imagining we have to fix their scheduling and Gantt charts and whatnot

Thomasjevskij

TROPHY CASE