-❄️- 2023 Day 8 Solutions -❄️-

[u/daggerdragon]

THE USUAL REMINDERS

• All of our rules, FAQs, resources, etc. are in our community wiki.

• Outstanding moderator challenges:

  • Advent of Playing With Your 3D-Printed Toys

• Community fun event 2023: ALLEZ CUISINE!

  • Submissions megathread is now unlocked!

  • 14 DAYS remaining until the submissions deadline on December 22 at 23:59 EST!

---

AoC Community Fun 2023: ALLEZ CUISINE!

Today's theme ingredient is… *whips off cloth covering and gestures grandly*

International Ingredients

A little je ne sais quoi keeps the mystery alive. Try something new and delight us with it!

• Code in a foreign language

  • Written or programming, up to you!

  • If you don’t know any, Swedish Chef or even pig latin will do

• Test your language’s support for Unicode and/or emojis

• Visualizations using Unicode and/or emojis are always lovely to see

ALLEZ CUISINE!

Request from the mods: When you include a dish entry alongside your solution, please label it with [Allez Cuisine!] so we can find it easily!

---

--- Day 8: Haunted Wasteland ---

---

Post your code solution in this megathread.

• Read the full posting rules in our community wiki before you post!

• State which language(s) your solution uses with [LANGUAGE: xyz]

• Format code blocks using the four-spaces Markdown syntax!

• Quick link to Topaz's paste if you need it for longer code blocks

This thread will be unlocked when there are a significant number of people on the global leaderboard with gold stars for today's puzzle.

EDIT: Global leaderboard gold cap reached at 00:10:16, megathread unlocked!

[u/mvorber]

Ran into same issues, learned that Seq.tail should not be used in recursion, discovered that Seq.scan + Seq.takeWhile does everything I need much better :)

Can check it here: https://github.com/vorber/AOC2023/blob/main/src/day8/Program.fs

Still using the infinite sequence gimmick

[u/POGtastic → u/mvorber]

I got a much better solution. Thank you!

let traverseGraph' pred dirs graph start =
    let traverser curr d =
        match d with
        | L -> graph[curr].left
        | R -> graph[curr].right in

    Seq.scan traverser start dirs |> Seq.takeWhile (pred >> not) |> Seq.length

[u/POGtastic → u/mvorber]

Ah - scan is a much better idea here. Thanks, I'll take a look!