movq

www.uninformativ.de

No description provided.

Recent twts from movq

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@twtxt.net 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@twtxt.net Here you go: https://movq.de/v/dfb04df5c7/aoc2023-day4-part2.txt

⤋ 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 If you can describe the problem, maybe I can help.

⤋ 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@twtxt.net I can try to explain, if you want to know. 😅 Or maybe this guy’s visualization will help (if you can see it, not sure): https://old.reddit.com/r/adventofcode/comments/18af47j/2023_day_4_scratchcard_counting/

⤋ Read More

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

Image

Image

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

⤋ 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@twtxt.net (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. 😂)

⤋ Read More
In-reply-to » I rotated June to September into their own archive feeds. I hope I didn't mess up. There's still one or the other manual step involved. I should write a few tests and automate it fully. It might also be a good idea to write a validator program which can check all the feeds for consistency.

@lyse@lyse.isobeef.org All I can say is: My client didn’t report any errors. :-) (Does that mean anything? 😅)

⤋ Read More
In-reply-to » Day 2, Part 1 and Day 2, Part 2 of #AdvenOfCode all done and dusted 😅

@xuu@txt.sour.is 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 …)

⤋ Read More

Here’s some more #AdventOfCode nostalgia:

https://movq.de/v/6441f2fe2a/MVI_6760.MOV.mp4

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

⤋ Read More
In-reply-to » ~22h to go for the 3rd #AdventOfCode puzzle (Day 3) 😅

@prologic@twtxt.net 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. 👌😂🥴

https://www.uninformativ.de/git/advent-of-code/file/2023/day02/s.c.html

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”. 😅

⤋ Read More
In-reply-to » 👋 Hey you Twtxters/Yarners 👋 Let's get a Advent of Code leaderboard going!

@prologic@twtxt.net The solutions will go here:

git clone https://uninformativ.de/git/advent-of-code.git

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

https://movq.de/v/de32f1481f/MVI_6756.MOV.mp4

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.

⤋ Read More
In-reply-to » Stats since I started doing GPS tracking of my walks in November 2022:

@prologic@twtxt.net 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. 😂

⤋ Read More

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

⤋ Read More
In-reply-to » @eapl.me There it is! https://www.youtube.com/watch?v=HDicLHBvQQM 🥳

That last story he tells there (about the masked interrupts), that’s what fascinates me about computing. 😍 You’re close to the machine and you’re dealing with interesting problems. I find this way more intriguing than all the “modern” hyped stuff like “““AI”””.

⤋ Read More
In-reply-to » See, even a video I was just watching on Youtube just now, the guy said:

@prologic@twtxt.net

I’m willing to get that Google™ is losing ad revenue from sponsored advertising and sponsors of Youtubers.

That sounds like a plausible explanation to me. (Then again, I have little insight into how “making money on YouTube” works. 😅)

Like @lyse@lyse.isobeef.org, I skip these sections immediately, unless it’s just one or two sentences. If it’s too long, I might just close the tab right away. 🤷

⤋ Read More
In-reply-to » LILYGO’s ESP32-based module comes with 2.41” AMOLED display The LILYGO T4 S3 is a small IoT module that supports 2.4 GHz Wi-Fi & Bluetooth 5 (LE) and it’s equipped with a 2.41” AMOLED display with capacitive touchscreen capabilities. This open-source board was designed for developers and hobbyists since it also supports Arduino and MicroPython. This is another recent module from LILYGO based on […] ⌘ Read more

@prologic@twtxt.net I don’t have a clue if they work or not. 😅 There are probably studies, but I’m too lazy to search now. 🤣

I, myself, don’t remember even having clicked on one of those banners and then proceeded to actually buy something. But what certainly does work on me is the effect of hearing/seeing a certain brand over and over again. “Oh, that’s a Logitech mouse, I know that manufacturer.” Stuff like that.

⤋ Read More
In-reply-to » LILYGO’s ESP32-based module comes with 2.41” AMOLED display The LILYGO T4 S3 is a small IoT module that supports 2.4 GHz Wi-Fi & Bluetooth 5 (LE) and it’s equipped with a 2.41” AMOLED display with capacitive touchscreen capabilities. This open-source board was designed for developers and hobbyists since it also supports Arduino and MicroPython. This is another recent module from LILYGO based on […] ⌘ Read more

@prologic@twtxt.net What I “love” about this is that the popup randomly disappears after just 1 or 2 seconds – and then reappears a litle while later. 🫤

⤋ Read More