movq

www.uninformativ.de

No description provided.

Recent twts from movq

One thing to note about #AdventOfCode: It is really, really important to inspect your input data.

Your data could be considered part of the puzzle description. By inspecting it, you can find clues and you might find out that you can make certain assumptions.

(I mean, what’s the alternative? There could be a list of allowed assumptions in the textual descriptions, right? That wouldn’t be a lot of fun, I think, as it would give away too much information about the solution. It’s more interesting to find those clues yourself.)

⤋ Read More
In-reply-to » So today's #adventofcode was solved with no programming. Just a bit o maths and wolfram/alpha

@xuu@txt.sour.is Nice! 😊 I like it when those puzzles are solvable using pen and paper. Some of the other puzzles require you to write lots and lots of code, that can be really tedious.

(Yes, I know that it’s called “Advent of *Code*”. 😂)

⤋ Read More
In-reply-to » Today’s AoC puzzle is a very simple problem on modern machines, but quite tricky for me: It involves a number that doesn’t fit into 32 bits. 🤔 I wonder if/how I can manage to port this beast to DOS. (I once wrote a “big int” library myself, but that was ages ago and I hardly remember it anymore.)

@xuu@txt.sour.is Yes, exactly that. But: I do have more than 32 bits after all, when I use double or long double. 😲 I went with long double which has 80 bits even on DOS (63 bits mantissa, I think).

(I only wrote a brute-force thingy this morning, so I didn’t even think about doing anything related to polynomials or double. 😅 Even part 2 only took 55 ms. But for DOS, this wasn’t an option anyway, so I did the proper math while waiting for something at work. 🤣)

It’s still a bit surprising to me. Usually, AoC doesn’t require such tricks and most things fit neatly into 32 bits. Maybe there’s a better solution after all. 🤔 I might have a look at reddit.

⤋ Read More

Today’s AoC puzzle is a very simple problem on modern machines, but quite tricky for me: It involves a number that doesn’t fit into 32 bits. 🤔 I wonder if/how I can manage to port this beast to DOS. (I once wrote a “big int” library myself, but that was ages ago and I hardly remember it anymore.)

⤋ Read More
In-reply-to » @movq It took a little over a minute on my machine.. i should try to make it multi threaded.. 🤔

@xuu@txt.sour.is I see, interesting. 🤔 Now I’m curious if I could optimize my brute-force solution as well. 😅 (I wrote a “proper” solution in the meantime after watching a visualization by someone else.)

⤋ Read More
In-reply-to » How did so many get the first star within the first 3 mins? Media

@prologic Doing AoC competitively is super hard. I don’t enjoy this at all. I just happened to be quick these first few days. 😅

I rather set my own goals. Like the DOS thing this year. That is a lot of fun. 😊 (I just have to remember not to check the leaderboards. 🤣)

⤋ Read More
In-reply-to » How did so many get the first star within the first 3 mins? Media

@xuu@txt.sour.is I ask myself that question every year. 🤣

To be fair, the first part wasn’t really that difficult. If you have A LOT of experience with these kind of problems/puzzles and if you have a proper framework, I imagine it’s doable. (I, on the other hand, spent about 40 minutes just writing my C code to parse the input.)

Some of these people record themselves and then post it on YouTube. It’s pretty crazy to watch. 🥴

The second part of the puzzle, was/is pretty hard, though. At least for me, because I haven’t found “the trick” yet. I’m currently trying to brute-force it while having breakfast. 😅 (But given that it took ~8 minutes for the first person to get both stars, maybe they brute-forced it as well. With a faster machine and multithreading, ~8 minutes sounds about right. Brute-force is rarely the answer in AoC, though.)

⤋ Read More
In-reply-to » It is a pleasure to work with the help system of Borland’s Turbo C++ 3.0 on DOS. The descriptions are clear and concise. There are short and simple examples. Pretty much every help page is cross-refenced and those links can be clicked.

@eapl.me@eapl.me It’s been a while since I used QBasic/QuickBasic, but yep, I remember the experience being quite similar. 😊

⤋ Read More
In-reply-to » @prologic @xuu Don't think I can reply to the thread in twtwt. Right now Jenny is not working for some reason. I wonder if @movq has any ideas. Anyway I am happy to be back and will see if I can get jenny working. Though my following list is gone now. Plus I can't see when someone mentions me if I am not follwing them so I should work on that.

@jason@jasonsanta.xyz I got it. I was already asleep yesterday. 😅

⤋ Read More
In-reply-to » @prologic @xuu Don't think I can reply to the thread in twtwt. Right now Jenny is not working for some reason. I wonder if @movq has any ideas. Anyway I am happy to be back and will see if I can get jenny working. Though my following list is gone now. Plus I can't see when someone mentions me if I am not follwing them so I should work on that.

@jason@jasonsanta.xyz Sure thing. The address is on my website. 👌

⤋ Read More

It is a pleasure to work with the help system of Borland’s Turbo C++ 3.0 on DOS. The descriptions are clear and concise. There are short and simple examples. Pretty much every help page is cross-refenced and those links can be clicked.

⤋ Read More
In-reply-to » Today's #AdventofCode #2023 was a bit of a whoozie 🤣 Not only did I have to work today (today being Monday et all), but also had to deal with a minor incident, then have dinner, etc and by the time I got back to my half-finished day 4 puzzle, I got a bit stuck with the 2nd part 🤦‍♂️ I guess I don't really like array manipulation, it's so easy to get lost 🤣

@prologic Here you go: https://movq.de/v/dfb04df5c7/aoc2023-day4-part2.txt

⤋ Read More