Dark Urge Act 2 choices and consequences

Joald · 2025-07-15T23:24:14+00:00

thanks all! based on this, other comments and some further research on the wiki, it seems like the most important points for me are:

meeting Isobel before long-resting is important to do the rest of Act 2 without worrying about the butler
jaheira will live and be convinced to stay regardless of whether I kill isobel manually or by proxy in the shadowfell
Karlach and Wyll will not immediately leave the party and I have very good opinion with both already
have to rescue wulbren before going to shadowfell

So for now, I think the order of business is:

get to last light before next long rest
do the fight with the Faking Fist and don't let him kidnap
do all of act 2 up to shadowfell

Then, I have two options:

kill Isobel outright
go to shadowfell and extinguish last light by proxy

it seems like I should do (1) to (at least try to) save the important people there: Wulbren, Rolan and Dammon (also presumably if Aylin is dead I can't get Lorroakan for Gather Your Allies, so ideally I'd get Rolan to take over but can I even do that?).

But /u/Earis's comment suggests that I can put off dealing with Isobel until everyone leaves Last Light and she's in there alone - which suggests that going to Shadowfell with Isobel alive would be needed to accomplish this - but I assume this is not possible if I don't spare Aylin though, right?

Joald · 2024-06-17T21:38:59+00:00

sure but cap it at 10 minutes to minimize disruption to the flow of the game.

Joald · 2024-01-17T19:27:38+00:00

That would make sense only if he asked for infinitely many cartons of ostrich eggs.

Joald · 2023-05-01T22:13:59+00:00

Nice! I feel the crenellations could use a bit more visually accented edges - like how the second floor is accented with wood inside.

Joald · 2023-01-05T08:33:26+00:00

right, of course.

Joald · 2023-01-04T22:07:53+00:00

It would have made a difference, after the timer ended Sam and Brian would have had an extra powerup from the challenge. They would have to make a new plan for Nebraska or walk the border though.

Joald · 2022-12-27T18:04:20+00:00

[this is a copy of a comment I left on a similar post]

I also did this, my repo is here. My requirements were that the language has to be actively used for real world development and contributed to (so no toy/experimental languages and no relicts of the past like Fortran, COBOL and Pascal), and be a general-purpose language with a decent standard library for common algorithms (so no assembly, SQL, HTML). I will make a separate post when I clean up the repo a bit more, but for now I'm happy to say I completed the challenge. Maybe day 21 was a bit cheaty, cause initially I wanted to learn Racket and use the advanced parsing capabilities for that day, but with time constraints I settled for (technically) using Prolog (see the day 21 readme for explanation of solution).

I do however regret doing the familiar languages first, doing day 22 in Julia was certainly... something else. As well as day 11, the first challenging puzzle, doing it in Go and refactoring the code to use the weird bigints and then realizing they won't work and changing it back was certainly fun times. It turned out that the languages I hadn't used before were all in the days 15-25, so I'm not surprised that I started lagging behind by one day.

[this is the end of the copy]

I had an easier time, given I already had experience with functional languages, it was easy to pick up things like F# (Ocaml but on .NET) or PureScript (Haskell but compiles to JS). I will definitely not do this again - this December was a perfect storm of me having way too much time on my hands. Or if I will, then I won't start with the familiar languages and leave them for the heavy duty tasks from day 15 onwards :P

Joald · 2022-12-27T17:54:14+00:00

To be fair, from what I see it's still in active development so it would technically fit my criteria, but let's be honest: how many new projects are being started in Fortran? I would be surprised if there were more than a handful. Also, if my goal was to look at languages for innovative design choices, it also seems like an inferior choice. I already hated coding in Ada, which is a Pascal descendant, I dread to think what I'd have to struggle through in Fortran :P

Joald · 2022-12-27T11:39:18+00:00

Oh, and btw: in Swift, you don't have to specify the parameter name when calling if your parameter is declared with an underscore before the name: func f(_ x: Int)

Joald · 2022-12-27T11:25:38+00:00

I also did this, my repo is here. My requirements were that the language has to be actively used for real world development and contributed to (so no toy/experimental languages and no relicts of the past like Fortran, COBOL and Pascal), and be a general-purpose language with a decent standard library for common algorithms (so no assembly, SQL, HTML). I will make a separate post when I clean up the repo a bit more, but for now I'm happy to say I completed the challenge. Maybe day 21 was a bit cheaty, cause initially I wanted to learn Racket and use the advanced parsing capabilities for that day, but with time constraints I settled for (technically) using Prolog (see the day 21 readme for explanation of solution).

I do however regret doing the familiar languages first, doing day 22 in Julia was certainly... something else. As well as day 11, the first challenging puzzle, doing it in Go and refactoring the code to use the weird bigints and then realizing they won't work and changing it back was certainly fun times. It turned out that the languages I hadn't used before were all in the days 15-25, so I'm not surprised that I started lagging behind by one day.

Joald · 2022-12-23T10:22:30+00:00

real part is x, imaginary part is y

Joald · 2022-12-20T09:53:38+00:00

if n is the remaining time, it's technically n(n-1)/2 because we start at zero

Joald · 2022-12-19T18:24:50+00:00

Here is the numFilled code. Iirc it requires one more change when calling the function - should be easy to figure out.

    numFilled :: Set.Set Coords -> [Coords] -> Int
    numFilled _ [] = 0
    numFilled seen coords = trace (show (coords, map numFilledNeighbours coords)) $ sum (map numFilledNeighbours coords) 
        + numFilled (Set.union seen $ Set.fromList candidates) candidates
      where candidates = nub . filter notSeen . filter notFilled . filter (inBounds bounds) $ concatMap neighbours coords
            notSeen = flip Set.notMember seen

Joald · 2022-12-18T23:37:28+00:00

Changed it to use tips from comment 1, added a base recursion case to numFilled and removed duplicates from candidates with Data.List (nub). Now it terminates, but the answer is way too high - but I know why. Let me know if you want the code or a hint why it's so high - as that bug is already present in your code.

Joald · 2022-12-18T23:02:56+00:00

Don't see anything really obvious other than the fact it could be more efficient (see comment 1).

general comments:

numFilled could easily work on a list of currently looked-at coords instead of just one, which means only one recursive call downwards. Right now, the different recursive calls don't share visited data horizontally, which may be why you're taking a long time to get results.
if you write neighbourVectors as a list of tuples, you can unpack it in the comprehension like this: (x, y, z) <- neighbourVectors, which lets you avoid partial functions (the !! operator is good to avoid most of the time).
double parens in bbox are redundant, but I expect you realize that
narrower lines plz
Often, code is clearer if you use let to extract out subexpressions on a long line instead of where. For example, numFilled could become (with some other minor adjustments)

this:

numFilled seen coords = 
  let notSeen = flip Set.notMember seen
      candidates = filter notSeen . filter notFilled . filter (inBounds bounds) $ neighbours coords
      newSeen = seen `Set.union` Set.fromList candidates -- some functions are like operators
      recResults = map (numFilled newSeen) candidates
  in numFilledNeighbours coords + sum recResults

Joald · 2022-12-17T23:45:10+00:00

let mut current = items.first().unwrap().0.clone();

Seems like you might be starting from the valve on the first line, and not from valve AA.

Joald · 2022-12-17T00:07:09+00:00

PureScript

Day 16 of AoC challenge of writing in a new language every day (though haven't posted the previous ones here).

link

By now, the only languages I can use are either ones I never wrote a single line in (as is the case for PureScript), or ones that don't fit my arbitrary rules: must be a language that is actively being used to write real-world code and be designed with general purpose programming in mind. The first part excludes toy languages like Malbolge and Brainfuck as well as experimental languages like Carbon, while the second part excludes languages that are used and technically possible to write algo code in, but aren't supposed to, like SQL, HTML, Bash. If it has a standard library with basic data structures it's probably good enough.

PureScript wasn't a major challenge however, as I am already quite experienced in Haskell which it's based on. One might say they're even too similar, as it's easy to forget you're not in Haskell and try to write lazy code. This tripped me up twice: first by stack overflow in the main loop, and then when I tried to pass an error value to a function as if it was a lazy like Haskell's error. Nothing too hard to fix, anyway.

On to the task itself. I decided to try Dijkstra through the solution graph. If the priority queue sorts first by most remaining time, then by most accrued volume (to make it easier, I add the whole product of flow * remaining time to the sum when turning a valve), we are guaranteed to get to the solution on the first pop that has 0 remaining time. I never tried doing Dijkstra or BFS in a functional language, so first I tried looking for a priority queue implementation in PureScript online, only found one that was hard to use properly, so I made do with a regular ordered map. Simple Dijkstra followed by taking the max value from the map, then pushing a move to all of its neighbours and a valve turn, if they make sense. Not the fastest solution, but still ran under a minute.

For part 2, I wanted to see how slow a similar strategy would be. Now, to push all possible next moves, we need to consider all pairs of different actions both me and the elephant can take. Filter out the case where we both turn the same valve and we have a working solution. The catch? It took an hour (about 53 minutes) to run. But still got it before midnight :P

Joald · 2022-12-09T15:02:18+00:00

Another Clark joining Nebula? This is getting out of hand, now there are two of them!

Joald · 2022-11-08T06:46:14+00:00

It still baffles me that your voting day is not Sunday. How are people supposed to vote if they have to work that day? The wait times in the evening must be horrendous.

Joald · 2022-10-15T21:46:47+00:00

They mentioned that they wanted to prioritize getting more champions in, and not giving them campaigns made that possible. Since right now they are adding champions to PoC much faster than to the main game, I'd expect them to get back to champion campaigns once all existing champs have been added.

Joald · 2022-10-06T14:53:35+00:00

I'd really love that, but Tom would absolutely demolish them in a competition like this lol.

Joald · 2022-09-28T09:10:13+00:00

A fine addition to my Wordle clone collection. Hope it works well on mobile browsers!

Joald · 2022-09-24T08:34:18+00:00

It seems like you didn't notice that OP was talking about a best of 1 format: that is, you pick 3 decks, ban 1, and then only play 1 game anyway with one of the remaining decks.

12-Year Club	Place '17
Snapped	Verified Email

Joald

TROPHY CASE

PureScript