Block / Report User

If this user/feed is violating this Pod's ( community guidelines as set out in the Abuse Policy, please report them immediately!

You are also free to Unfollow or Mute this user or feed. Muting will also remove that user/feed's content from your view and you will no longer see content from that user/feed anywhere.

@movq does not follow you (they may not see your replies!)

Recent Twts

Recent twts from movq

(#y7edboa) 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.


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.)


(#irslaoq) 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.)


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.


A couple centimeters of snow today. 😊 And I’ve got a loooooooong vacation coming up. Time to relax. 😃

This is my favorite time of the year – by far. Even if it means the snow will freeze in my beard. 😂


(#zkjovca) (Mild spoilers ahead.)

Today’s puzzle was one of those where I immediately knew that there must be a solution that does not require actually copying anything. AoC often has these kinds of problems that make it look like you have to create lots of duplicates, multiply objects, stuff like that. That’s often a sign that you can solve it by doing something simple. 😅 (If only that was true in real life as well. 😂)


(#6oq4ywq) Ah, you went with the “scanning” approach as well. I did that, too.

It’s quite surprising to see (imho) how many people on reddit started substituting strings (one becomes 1 etc.). That makes the puzzle much harder by introducing nasty corner cases.

(Maybe I was just lucky this time to pick the correct approach right from the start. 🤣 Or maybe it’s a bit of experience from doing past AoC events …)


Here’s some more #AdventOfCode nostalgia:

It shows the machine’s boot sequence and the copy process: I somehow have to grab the files from my normal PC and I do that using FTP under Windows 3.11, there’s a PCI Ethernet card in that machine. Then some glorious WinZip action to decompress the files. 😃 Finally the first two AoC 2023 puzzles are being run.

(Yes, there’s a GRUB on that machine. 🥴 It’s a left-over from some experiments with Linux ages ago and I didn’t bother to uninstall it.)


(#wg7xx5q) That is a lot of code, yes. 😅 Mine is shorter, has more naive searching (it searches a word like red and then backtracks to the number before it; completely ignoring the semi-colons because they don’t matter), and – like any good C program – will crash horribly on malformed input. 👌😂🥴

It really depends on what you’re after. I’d never write code like this in “real-world applications”. But for these puzzles and my DOS use case, it’s “good enough”. 😅


(#kr3qhra) The solutions will go here:

git clone

About demos … I made a video yesterday, but I’m not sure if it’s that interesting. 😅

I’d probably have to do some cool visualizations for the more interesting puzzles. 🤔 Not sure if I can pull that off, though. 😅 It’s probably going to be hard enough anyway. (I wonder how long I can get away with just conventional memory, i.e. only ~500 kB.) We’ll see.


(#hz2qwyq) I walked. 😅 I mean, I walk rather fast and it’s not a relaxed stroll, but it certainly isn’t running. 😅 The goal isn’t to lose weight but to be outdoors, enjoy nature, and clear my mind.

Just to be clear, it was 100km over the course of a whole month. It was 23 tracks with 4.4km per track on average (4.4km is roughly 50 minutes). It’s actually not that much, it’s mostly time consuming. 😂


I posted this link about Windows 3’s architecture and VMs a while ago, but this topic continues to fascinate me. Raymond Chen brought it up again recently.

I’m aware that virtualization itself is much older than Windows 3 (IBM did it in the 1960ies, I believe?), but knowing that similar concepts existed in my tiny little machine that ran Windows 3.1 is just mindblowing. 🤯 (Alright, it wasn’t exactly “tiny”. It was an IBM PS/2 Model 80. 🤣)