Thanks Homer.

  • Ananace@lemmy.ananace.dev
    13·
    11 months ago

    2D grids and parsing data from them in all manner of interesting ways is a real AoC staple.

    I’m still hoping to be met with a problem at some point which can be solved by handling it as a type of funge program.

    • mykl@lemmy.worldOP
      4·
      11 months ago

      Oh indeed, but it’s normally quite straightforward in the first few days. Certainly my terrible solution today is longer than any in the first maybe 10 days of last year.

      What’s a “funge program”? [edit, oh befunge-like I guess]

      • Ananace@lemmy.ananace.dev
        6·
        11 months ago

        Yep, funge has been used to describe any kind of multi-dimensional programming language - often with self-modifying code, I’ve personally found both 3D and 4D funge languages.

        There’s just something with the whole concept that amuses me, I’ve been trying to build some kind of funge-style programming puzzle game for a while now, but haven’t figured out a good hook to take it past being just a PoC yet.

        • mykl@lemmy.worldOP
          3·
          11 months ago

          I’m not sure whether to be intrigued or horrified at the idea of an AoC type challenge where we slowly build up a 4D “FungeCode” interpreter like 2019’s IntCode series (which I notice I still haven’t completed!)

          • Ananace@lemmy.ananace.dev
            3·
            11 months ago

            Writing and debugging 4D code is… interesting.

            When your code can’t just run forwards and backwards, but also left and right, up and down, and even inwards and outwards.

    • mykl@lemmy.worldOP
      1·
      11 months ago

      Haha, that’s funny now but let’s see how we all feel in a couple of weeks…

    • BatmanAoD@programming.dev
      1·
      11 months ago

      Is there usually less parsing? I haven’t participated in previous years. (I guess I can just check the previous years’ problems, but there are a lot of those.)

  • Mikina@programming.dev
    6·
    11 months ago

    So far I’ve usually had success with just going for regex, but the second challenge today bacfired quite spectacullary. I’m still postponing having to rewrite my solution, because unfortunately it’s not really possible to have 2D regex (as far as I know, would be awesome).

    I guess just going with some kind of flood algorithm will be the way to go, but that’s effort

  • Black616Angel@feddit.de
    5·
    11 months ago

    Day one really got me with those pesky overlapping words like eightwo or twone.

    Today was actually really easy the way I did it.
    I searched through all the characters of the lines and when I got one that wasn’t a number or a period, I looked at all the 8 places around to find the numbers. The numbers I completed by looking in both directions until I got a non-number.
    Then I put all numbers and their starting positions in an array, deleted the duplicates and summed them.

    By doing this, question 2 only took me 4 minutes.

    • UndercoverUlrikHD@programming.dev
      2·
      11 months ago

      Hmm, I did it the opposite. Found every number and passed a list of every adjacent position of the number to check for non-digit/dot/non-whitespace.

      Took a bit longer to solve part 2 due to that approach though.

    • mykl@lemmy.worldOP
      2·
      11 months ago

      Yeah it looks like the better solutions generally took that route. I convinced myself that the symbols were going to all have different rules in part 2, so ended up thinking about it way too hard for day 3 😀

      • Black616Angel@feddit.de
        2·
        11 months ago

        Thought so too, but for me it was a simple match statement (rust), which then became a glorified if statement. 😂

  • learningduck@programming.dev
    4·
    11 months ago

    I don’t want to read the number string from both left to right and Ruth to left. So, I

    1. iterate through each row and read the number string from left to right
    2. Store each number along with its cell range. ie: 467 is 0-2.
    3. Then from each symbol, find out if the position of the symbol +/-1 falls into any range. If so then sum that number.
  • stifle867@programming.dev
    3·
    11 months ago

    I haven’t been parsing the input string character by character and instead have been parsing into native data structures. It makes the code more verbose but it’s how I want to do it. Unfortunately it does mean most of the time coming up with a solution is structuring the data so I’m hoping I come up with a faster way after a few days.

    • mykl@lemmy.worldOP
      2·
      11 months ago

      Yeah, I couldn’t see a nice approach today so I fell back on an existing Grid class I’ve used in previous years. Having those existing tools helps a lot.

      • stifle867@programming.dev
        2·
        11 months ago

        I’m still working on my part 1 😭 string parsing makes me feel so stupid haha. But I’m adamant on coming up with a “nice” solution even if the number of lines aren’t minimal. I’ve got something quite nice at the moment and I anticipate coming in under 100 lines (including whitespace, comments, and formatting).

  • Cyno@programming.dev
    1·
    11 months ago

    I went with a matrix approach and was just planning to handle it through indexes but kinda gave up halfway implementing the finding of numbers, their start/end positions… I’m guessing a regex but that might have issues if we have identical numbers later, so not sure. Will surely go back to it eventually though :P

    • mykl@lemmy.worldOP
      2·
      11 months ago

      I have a Grid class from previous years so I sort of fell into that approach too. Once you’ve got the groundwork into place the solution is not so hard to get to. Hopefully I won’t have to think so hard tomorrow!