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

Image

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

Mon l470 est décidément trop lourd à transporter. Je vais transférer #openbsd sur mon x250 et racheter une batterie. Vous auriez des conseils de fournisseurs fiables?

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

Oh.. Right. Need subtract and divide too for the binomial

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

@movq@www.uninformativ.de it shouldn’t need a full bignum implementation right? Just some left and right shifts for the sq/sqrt and carry for the addition right?

⤋ 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 » literally cannot get past day one. what's the trick?

The word forms is part two. In this one you want to find the first digit and last digit. Think searching ‘1’ - ‘9’

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

All brute force.

Its the latest ryzen 7 chipset for laptop/mini form factor.

I am very surprised about the times others are getting. I guess that’s the difference between interpreted and compiled showing.

⤋ Read More
In-reply-to » 1960s Chatbot ELIZA Beat OpenAI's GPT-3.5 In a Recent Turing Test Study An anonymous reader quotes a report from Ars Technica: In a preprint research paper titled "Does GPT-4 Pass the Turing Test?", two researchers from UC San Diego pitted OpenAI's GPT-4 AI language model against human participants, GPT-3.5, and ELIZA to see which could trick participants into thinking it was human with the greatest success. B ... ⌘ Read more

That is pretty hilarious 🤣

⤋ Read More
In-reply-to » … it just finished and brute-force worked. 18 minutes of computing time on my 11 year old machine, single-threaded.

@movq@www.uninformativ.de It took a little over a minute on my machine.. i should try to make it multi threaded.. 🤔

Executed in   68.96 secs    fish           external
   usr time   60.84 secs  242.00 micros   60.84 secs
   sys time   12.52 secs  252.00 micros   12.52 secs

⤋ Read More

Last night it got much warmer (~6°C) than it was on the day itself (below freezing). That usually never happens. The snow melted and little avalanches came crashing down the roof. All the bangs scared the hell out of me last night.

⤋ 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 » 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 I have many fond memories of Turbo pascal and Turbo C(++). They really did have a great help system. And debug tools! Its rare for language docs to be as approachable. QBasic was great. As was PHP docs when I first came into web.

⤋ 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

Playing Oracle of Ages on Switch…

I’m not enjoying at all the Game Design. Has its moments, but nothing compared with Awakening or Minish Cap 😐

⤋ Read More

My #AdventOfCode2023 has been calculating statistics for manufacturing 😆

Today was processing a list of states (e.g. A from 6:40 to 7:25, B from 7:25 to 8:15) and getting what happened hourly from 6am to the next 24 hours.
Put timezones into the equation for more fun.
And finally explain all that to the Jr.

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

never used Turbo C++, although I have good memories of QBasic and QuickBasic.

The help was amazing. You pressed some F key on a keyword, and you got an explanation, example code and a kind of Wiki to keep exploring and learning…

⤋ 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 🤣

@movq@www.uninformativ.de Thank you! 🙏 🙇‍♂️

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

@movq@www.uninformativ.de Did you get the email I sent? I found two emails and did not know what one to send to.

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

@movq@www.uninformativ.de Its more than one line I can email it to you if you like

⤋ 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