@neilnjae@dice.camp
@neilnjae@dice.camp avatar

neilnjae

@neilnjae@dice.camp

Mainly here for the TTRPG community. I'm at the story / indie games end of things. #RPG #TTRPG

This profile is from a federated server and may be incomplete. Browse more on the original instance.

LeviKornelsen, (edited ) to random
@LeviKornelsen@dice.camp avatar

deleted_by_author

  • Loading...
  • neilnjae,
    @neilnjae@dice.camp avatar

    @LeviKornelsen I think the heavily constrained mechanical arc of My Life With Master doesn't quite sit in category 3.

    Games like Montsigeur, Rosenstrasse are also, I think, a bit outside your categories: the "plot" is defined but the "story" comes from choices within it.

    neilnjae,
    @neilnjae@dice.camp avatar

    @LeviKornelsen Cool, as long as they're in there somewhere!

    DejahEntendu, to scifi
    @DejahEntendu@dice.camp avatar

    Space Opera by Catherynne M. Valente

    "Take me to your lead singer."

    What if proving sentience to the other inhabitants of the universe was just like Eurovision?

    This is the first goofy scifi I've read that actually comes close to living up to Adams' Hitchhikers without overdoing it the whole way through. Parts are wryly cutting, lambasting those who deserve it, like officious governmental cogs too full of...

    1/

    @bookstodon

    neilnjae,
    @neilnjae@dice.camp avatar

    @DejahEntendu @bookstodon It's a great book! So full of love of life.

    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

    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

    neilnjae, to random
    @neilnjae@dice.camp avatar

    Hi @megueyb & @lumpley ! We're having great fun with a game of Under Hollow Hills, but a question.

    For us, the performance seems divorced from the play that proceeds it. Any tips on bringing them together?

    We've done a couple of Occasions. Everyone really enjoys getting into the situation. But the transition from that to the performance seems forced.

    Any tips on how to make the Performance flow naturally from the previous play? Is it something about going from reactive to proactive play?

    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

    neilnjae, to random
    @neilnjae@dice.camp avatar

    For no reason, I want to remind people of the wonderful "The Thrilling Adventures of Lovelace and Babbage" by Sydney Padua https://app.thestorygraph.com/books/fff0586f-4d2b-4514-846d-cc2d0d7b74ec

    neilnjae, to haskell
    @neilnjae@dice.camp avatar
    neilnjae,
    @neilnjae@dice.camp avatar

    @mina There's a working replica in the Science Museum in London. (But they don't operate it very often. ) It's lovely. It's huge!

    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

    robb, to random
    @robb@social.lol avatar

    💻 Advent of Code 2023: Day Seven https://rknight.me/advent-of-code-2023-day-seven/

    A good day today.

    neilnjae,
    @neilnjae@dice.camp avatar

    @robb I'm enjoying reading your posts. Thanks for writing them!

    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

    neilnjae, to haskell
    @neilnjae@dice.camp avatar
    neilnjae, to haskell
    @neilnjae@dice.camp avatar

    day 5 done, still in . This one got into the off-by-one errors of integer intervals, but ended up quick.

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

    neilnjae, to haskell
    @neilnjae@dice.camp avatar

    A suggestion on Reddit prompted me to revisit an earlier solution (day 2) to use the Applicative typeclass, and more use of built-in monoids.

    Description at
    https://work.njae.me.uk/2023/12/04/applicative-cubes-back-to-aoc-2023-day-2/

    RogerBW, to rust
    @RogerBW@emacs.ch avatar
    neilnjae,
    @neilnjae@dice.camp avatar

    @RogerBW Yes, parser combinators are the way to go!

    neilnjae, to haskell
    @neilnjae@dice.camp avatar

    Day 4 done, still in Haskell, simpler than the past couple now we're out of the weekend.

    A little bit of thought led to a pretty neat solution, I think.

    Full writeup at https://work.njae.me.uk/2023/12/04/advent-of-code-2023-day-04/
    Code at https://gitlab.com/NeilNjae/advent-of-code-23/-/blob/main/advent04/Main.hs

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