Advent of Code F# – Day 23

Yan Cui

I help clients go faster for less using serverless technologies.

This article is brought to you by

Don’t reinvent the patterns. Catalyst gives you consistent APIs for messaging, data, and workflow with key microservice patterns like circuit-breakers and retries for free.

Try the Catalyst beta

The source code for this post (both Part 1 and Part 2) is available here and you can click here to see my solutions for the other Advent of Code challenges.

Description for today’s challenge is here.

 

First, let’s define the 6 instructions on the computer:

day23_01

and parse the input file (see example below) into the DU type above

jio a, +16

inc a

tpl a

inc a

jmp +23

day23_02

Then we add a function to iterate through the instructions, a simple (tail) recursive loop function would do the trick. The below should be pretty self-explanatory, two tricky things to keep in mind:

  • that jio stood for “jump if one” rather than the more intuitive “jump if odd” given that jie is “jump if even”…
  • the problem specifies the register value to be non-negative, and just in case we’ll overflow, use an unsigned long

day23_03

and all that’s left is to call the function with the instructions we have parsed from the input and ask for the value of the b register at the end.

day23_04

 

Part 2

For Part 2, we just need to change the initial register values we pass into the loop:

day23_05

Whenever you’re ready, here are 3 ways I can help you:

  1. Production-Ready Serverless: Join 20+ AWS Heroes & Community Builders and 1000+ other students in levelling up your serverless game. This is your one-stop shop for quickly levelling up your serverless skills.
  2. I help clients launch product ideas, improve their development processes and upskill their teams. If you’d like to work together, then let’s get in touch.
  3. Join my community on Discord, ask questions, and join the discussion on all things AWS and Serverless.

1 thought on “Advent of Code F# – Day 23”

  1. Pingback: F# Weekly #52, 2015-IT??

Leave a Comment

Your email address will not be published. Required fields are marked *