huge pointers on DOS. I can now allocate a “single” block of data to hold an entire 640x480 image with 16 colors and then display it:
Segmentation is horrible. I’m glad we no longer do this.
huge pointers on DOS. I can now allocate a “single” block of data to hold an entire 640x480 image with 16 colors and then display it:Segmentation is horrible. I’m glad we no longer do this.
huge pointers on DOS. I can now allocate a “single” block of data to hold an entire 640x480 image with 16 colors and then display it:Segmentation is horrible. I’m glad we no longer do this.
The pipe maze puzzle was another good opportunity to do a little visualization.
My way of drawing bitmaps isn’t good, though. It’s just a series of
putpixel() calls. There has got to be a better way (not sure if BGI allows for something faster). 🤔https://movq.de/v/de55891ae3/MVI_6775.MOV.mp4
The pipe maze puzzle was another good opportunity to do a little visualization.
My way of drawing bitmaps isn’t good, though. It’s just a series of
putpixel() calls. There has got to be a better way (not sure if BGI allows for something faster). 🤔https://movq.de/v/de55891ae3/MVI_6775.MOV.mp4
The pipe maze puzzle was another good opportunity to do a little visualization.
My way of drawing bitmaps isn’t good, though. It’s just a series of
putpixel() calls. There has got to be a better way (not sure if BGI allows for something faster). 🤔https://movq.de/v/de55891ae3/MVI_6775.MOV.mp4
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.)
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.)
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.)
set sort = threads
set sort_aux = date-sent
set strict_threads = yes
I find this to be very non-confusing. 🤔
set sort = threads
set sort_aux = date-sent
set strict_threads = yes
I find this to be very non-confusing. 🤔
set sort = threads
set sort_aux = date-sent
set strict_threads = yes
I find this to be very non-confusing. 🤔
(Yes, I know that it’s called “Advent of *Code*”. 😂)
(Yes, I know that it’s called “Advent of *Code*”. 😂)
(Yes, I know that it’s called “Advent of *Code*”. 😂)
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.
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.
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.
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. 🤣)
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. 🤣)
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. 🤣)
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.)
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.)
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.)
> Holidays up until next year, hm?
Exactly that. 🛌
> Holidays up until next year, hm?
Exactly that. 🛌
> Holidays up until next year, hm?
Exactly that. 🛌
This video is from a couple of days ago – just frozen, no snow yet:
https://movq.de/v/527a76bd19/VID_20231203_104847.mp4.mp4
This video is from a couple of days ago – just frozen, no snow yet:
https://movq.de/v/527a76bd19/VID_20231203_104847.mp4.mp4
This video is from a couple of days ago – just frozen, no snow yet:
https://movq.de/v/527a76bd19/VID_20231203_104847.mp4.mp4
[](https://movq.de/v/deb1b7c7e6/1.jpg)
[](https://movq.de/v/deb1b7c7e6/2.jpg)
This is my favorite time of the year – by far. Even if it means the snow will freeze in my beard. 😂