nebyoolae, to random
@nebyoolae@masto.neb.host avatar

I've almost completed all of Advent of Code 2015 (only 9 years too late!). Day 21 was super fun, but Day 22 is possibly going to be oof.

D_schreiber, to adventofcode

Advent of Code 2023 recap blog post https://dan-schreiber.com/blog/2024/1/8/advent-of-code-2023-recap. Thanks to Eric Wastl and @adventofcode for another great year.

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 25 done in

I decided to use a probabilistic approach. I pick 200 random pairs of nodes and find the paths between them. About half those paths use the cut-set edges, so those three edges will be used more than the others. That's enough to identity the cut-set.

Full writeup: https://work.njae.me.uk/2024/01/06/advent-of-code-2023-day-25/

Code: https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent25/Main.hs

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 21 done in

A geometric approach to finding the solution, involving slicing up the map for part 2 into regions that would repeat, then finding how many of each I'd need for the final solution.

Full writeup: https://work.njae.me.uk/2023/12/29/advent-of-code-2023-day-21/

Code: https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent21/Main.hs

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 19 done in

Using the type system keeps me on track, and lenses and monoids keep things simple.

Full writeup: https://work.njae.me.uk/2023/12/24/advent-of-code-2023-day-19/

Code: https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent19/Main.hs

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 18 done in

A day of two parts: variations on parsing the input, and some fiddling around with finding the area (which I admit, I just looked up after a bit of a struggle).

Full writeup: https://work.njae.me.uk/2023/12/22/advent-of-code-2023-day-18/

Code: https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent17/Main.hs

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 17 done in

Things became much more simple when I stopped trying to be clever and instead represented the moves as actual Move records. I also used phantom types to handle the two types of move generation while keeping all the rest of the code the same.

Full writeup: https://work.njae.me.uk/2023/12/21/advent-of-code-2023-day-17/

Code: https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent17/Main.hs

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 15 done in

I thought I could get away without data structures and parsing, but it wasn't to be. This was a fairly straightforward one.

Full writeup: https://work.njae.me.uk/2023/12/18/advent-of-code-2023-day-15/

Code: https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent15/Main.hs

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 14 done in

I used a cache to find repeated states for part 2, then spent ages hunting an off-by-one error that wasn't there (I'd made a bigger mistake).

Full writeup: https://work.njae.me.uk/2023/12/18/advent-of-code-2023-day-14/

Code: https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent14/Main.hs

travis, to javascript
@travis@social.lol avatar

I've been doing the annual in using @glitchdotcom once again. I don't think I have made it in the top 5000 of any day, but they are still fun puzzles to solve https://github.com/dieseltravis/aoc2023

ottaross, to random
@ottaross@mastodon.social avatar

Aha - haven't tried Mastodon's feature before.

It seems like a useful feature for when you make a post that you intend to build on later.

For example, I got a new gadget and shared it in a toot, then bookmarked the toot. Now I can go back and tack on it, building a slow-moving thread with ease, rather than scrolling thru old posts trying to find it. Nice.

bjb,
@bjb@fosstodon.org avatar

@ottaross I'm using bookmarks to note spoilers and solutions, I will get back to them later after I try the problems ... I need to prepare for Christmas so don't have time every day to work on them before Christmas.

hamatti, to python
@hamatti@mastodon.world avatar

The solution to day 16 of turned out really pretty looking thanks to 's pattern matching.

It's by far my favorite feature in Python.

https://hamatti.org/adventofcode/2023/day_16/

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 12 finally done in

Brute force suffices for part 1, but I had to use dynamic programming to solve part 2.

Full writeup: https://work.njae.me.uk/2023/12/15/advent-of-code-2023-day-12/
Code: https://gitlab.com/NeilNjae/advent-of-code-23/-/tree/main/advent12

premartinpatrick, to Twitch French
@premartinpatrick@mastouille.fr avatar

Bien, bien, bien.

Ca m'aura travaillé une partie de la nuit en batch.

J'étais vraiment parti sur un truc bien trop tordu mais je dois pouvoir faire encore pire pour résoudre le premier exercice du jour 12 de l'. Alors pour ne pas me pourrir la journée je m'en occupe vers 9h30 sur .

RDV sur https://www.twitch.tv/patrickpremartin

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 11 in

A good choice for representation made part 2 trivial (apart from an off-by-one error). Lots of folds to update collections of things.

Full writeup on my blog: https://work.njae.me.uk/2023/12/11/advent-of-code-2023-day-11/
Code on Gitlab: https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent11/Main.hs

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 10 in

Nothing much clever here. Depth first search to find the loop, breadth-first search to flood-fill the regions. The only clever bit is doubling the scale of the map to make it easy to "squeeze between pipes."

Full writeup on my blog https://work.njae.me.uk/2023/12/10/advent-of-code-2023-day-10/.

Code on Gitlab https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent10/Main.hs

hamatti, to python
@hamatti@mastodon.world avatar

I feel really 50-50 about this day 10 of : the programming itself was quite nice and I got to use the Complex Number Coordinate System but I struggled with a few parts of figuring out how to solve things.

Still, I'm 20/20 with this year and it's only 4pm on Sunday evening so I still have plenty of time today to do other stuff.

https://hamatti.org/adventofcode/2023/day_10/

jonocarroll, to random
@jonocarroll@fosstodon.org avatar

Advent of Code 2023 Day 7 (part 1) comparison between (Dyalog) , , and base https://jcarroll.com.au/2023/12/10/advent-of-array-elegance/ -- in which I detail an elegant array solution.

I'm all in for learning the APL glyphs, now!

FYI @loke

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 9 in

Refreshingly easy! It's good to go old-school, and you don't get much more old-school than Babbage's Difference Engine!

https://en.wikipedia.org/wiki/Difference_engine#Method_of_differences

Full writeup at https://work.njae.me.uk/2023/12/09/advent-of-code-2023-day-09/

Code at https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent09/Main.hs

lewis, to random

New post: Advent of Code 2023: Day Nine

Completing Day Nine of

https://lewisdale.dev/post/advent-of-code-2023-day-nine/

lispm, to Lisp German
@lispm@moth.social avatar

day 5 using a in , the code is using CLOS classes

Middle click on an object in the Lisp Listener (aka :) describes the object

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 8 in

I'm not a fan of this type of reverse-engineering, find-the-clever-trick sort of puzzle (in this context).

Part 1 was pretty straightforward. Part 2 resisted all efforts at exploration, so I resorted to looking on Reddit and finding the trick.

Full writeup on my blog https://work.njae.me.uk/2023/12/08/advent-of-code-2023-day-8/

and code on Gitlab https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent08/Main.hs

joeygibson, to programming
@joeygibson@hachyderm.io avatar

I’ve tried theee times now to have an AI write programs to solve this year’s problems, and in each case they’ve written lovely code with useful comments that doesn’t work.

If there’s an AI that can actually generate solutions, I’d like to know which one. I used ChatGPT and GitHub Copilot.

(And yes, I only did this after I’d written my own working solutions.)

neilnjae, to haskell
@neilnjae@dice.camp avatar

day 7 done, in . Being explicit about data ended up making the problem easy to think about.

Full writeup at https://work.njae.me.uk/2023/12/07/advent-of-code-2023-day-07/

Code at https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent07/Main.hs

hamatti, to python
@hamatti@mastodon.world avatar

Over the years of learning and teaching programming, I've modeled card games, especially poker, so many times that day 7 of was straight-forward for me.

In terms of Python stuff, today's solution uses classes, inheritance and enums that I haven't yet used this year.

https://hamatti.org/adventofcode/2023/day_7/

  • All
  • Subscribed
  • Moderated
  • Favorites
  • •
  • JUstTest
  • tacticalgear
  • DreamBathrooms
  • InstantRegret
  • magazineikmin
  • Youngstown
  • everett
  • cisconetworking
  • slotface
  • GTA5RPClips
  • rosin
  • thenastyranch
  • kavyap
  • mdbf
  • Leos
  • modclub
  • osvaldo12
  • Durango
  • khanakhh
  • anitta
  • provamag3
  • ngwrru68w68
  • cubers
  • tester
  • ethstaker
  • megavids
  • normalnudes
  • lostlight
  • All magazines
    •