Solve day 08 part 1

data/examples/08.txt

@@ -0,0 +1,5 @@
+LLR
+
+AAA = (BBB, BBB)
+BBB = (AAA, ZZZ)
+ZZZ = (ZZZ, ZZZ)

data/puzzles/08.md

@@ -0,0 +1,89 @@
+\--- Day 8: Haunted Wasteland ---
+----------
+
+You're still riding a camel across Desert Island when you spot a sandstorm quickly approaching. When you turn to warn the Elf, she disappears before your eyes! To be fair, she had just finished warning you about *ghosts* a few minutes ago.
+
+One of the camel's pouches is labeled "maps" - sure enough, it's full of documents (your puzzle input) about how to navigate the desert. At least, you're pretty sure that's what they are; one of the documents contains a list of left/right instructions, and the rest of the documents seem to describe some kind of *network* of labeled nodes.
+
+It seems like you're meant to use the *left/right* instructions to *navigate the network*. Perhaps if you have the camel follow the same instructions, you can escape the haunted wasteland!
+
+After examining the maps for a bit, two nodes stick out: `AAA` and `ZZZ`. You feel like `AAA` is where you are now, and you have to follow the left/right instructions until you reach `ZZZ`.
+
+This format defines each *node* of the network individually. For example:
+
+```
+RL
+
+AAA = (BBB, CCC)
+BBB = (DDD, EEE)
+CCC = (ZZZ, GGG)
+DDD = (DDD, DDD)
+EEE = (EEE, EEE)
+GGG = (GGG, GGG)
+ZZZ = (ZZZ, ZZZ)
+
+```
+
+Starting with `AAA`, you need to *look up the next element* based on the next left/right instruction in your input. In this example, start with `AAA` and go *right* (`R`) by choosing the right element of `AAA`, `*CCC*`. Then, `L` means to choose the *left* element of `CCC`, `*ZZZ*`. By following the left/right instructions, you reach `ZZZ` in `*2*` steps.
+
+Of course, you might not find `ZZZ` right away. If you run out of left/right instructions, repeat the whole sequence of instructions as necessary: `RL` really means `RLRLRLRLRLRLRLRL...` and so on. For example, here is a situation that takes `*6*` steps to reach `ZZZ`:
+
+```
+LLR
+
+AAA = (BBB, BBB)
+BBB = (AAA, ZZZ)
+ZZZ = (ZZZ, ZZZ)
+
+```
+
+Starting at `AAA`, follow the left/right instructions. *How many steps are required to reach `ZZZ`?*
+
+Your puzzle answer was `17263`.
+
+The first half of this puzzle is complete! It provides one gold star: \*
+
+\--- Part Two ---
+----------
+
+The sandstorm is upon you and you aren't any closer to escaping the wasteland. You had the camel follow the instructions, but you've barely left your starting position. It's going to take *significantly more steps* to escape!
+
+What if the map isn't for people - what if the map is for *ghosts*? Are ghosts even bound by the laws of spacetime? Only one way to find out.
+
+After examining the maps a bit longer, your attention is drawn to a curious fact: the number of nodes with names ending in `A` is equal to the number ending in `Z`! If you were a ghost, you'd probably just *start at every node that ends with `A`* and follow all of the paths at the same time until they all simultaneously end up at nodes that end with `Z`.
+
+For example:
+
+```
+LR
+
+11A = (11B, XXX)
+11B = (XXX, 11Z)
+11Z = (11B, XXX)
+22A = (22B, XXX)
+22B = (22C, 22C)
+22C = (22Z, 22Z)
+22Z = (22B, 22B)
+XXX = (XXX, XXX)
+
+```
+
+Here, there are two starting nodes, `11A` and `22A` (because they both end with `A`). As you follow each left/right instruction, use that instruction to *simultaneously* navigate away from both nodes you're currently on. Repeat this process until *all* of the nodes you're currently on end with `Z`. (If only some of the nodes you're on end with `Z`, they act like any other node and you continue as normal.) In this example, you would proceed as follows:
+
+* Step 0: You are at `11A` and `22A`.
+* Step 1: You choose all of the *left* paths, leading you to `11B` and `22B`.
+* Step 2: You choose all of the *right* paths, leading you to `*11Z*` and `22C`.
+* Step 3: You choose all of the *left* paths, leading you to `11B` and `*22Z*`.
+* Step 4: You choose all of the *right* paths, leading you to `*11Z*` and `22B`.
+* Step 5: You choose all of the *left* paths, leading you to `11B` and `22C`.
+* Step 6: You choose all of the *right* paths, leading you to `*11Z*` and `*22Z*`.
+
+So, in this example, you end up entirely on nodes that end in `Z` after `*6*` steps.
+
+Simultaneously start on every node that ends with `A`. *How many steps does it take before you're only on nodes that end with `Z`?*
+
+Answer:
+
+Although it hasn't changed, you can still [get your puzzle input](8/input).
+
+You can also [Shareon [Twitter](https://twitter.com/intent/tweet?text=I%27ve+completed+Part+One+of+%22Haunted+Wasteland%22+%2D+Day+8+%2D+Advent+of+Code+2023&url=https%3A%2F%2Fadventofcode%2Ecom%2F2023%2Fday%2F8&related=ericwastl&hashtags=AdventOfCode) [Mastodon](javascript:void(0);)] this puzzle.

src/bin/08.rs

@@ -0,0 +1,57 @@
+use std::collections::HashMap;
+
+advent_of_code::solution!(8);
+
+pub fn part_one(input: &str) -> Option<u32> {
+    let mut lines = input.lines();
+    let instructions: Vec<char> = lines.next().unwrap().chars().collect();
+    lines.next();
+    let mut map: HashMap<&str, (&str, &str)> = HashMap::new();
+    for line in lines {
+        let parts = line.split(" = ").collect::<Vec<_>>();
+        let start = parts[0];
+        let destinations = parts[1].split(", ").collect::<Vec<_>>();
+        let mut a = destinations[0].chars();
+        a.next();
+        let mut b = destinations[1].chars();
+        b.next_back();
+
+        map.insert(start, (a.as_str(), b.as_str()));
+    }
+
+    let mut current_node_label = "AAA";
+    let mut i = 0;
+    while current_node_label != "ZZZ" {
+        let current_node = map.get(current_node_label).unwrap();
+        match instructions[i % instructions.len()] {
+            'L' => current_node_label = current_node.0,
+            'R' => current_node_label = current_node.1,
+            _ => unreachable!()
+        }
+
+        i += 1;
+    }
+
+    Some(i as u32)
+}
+
+pub fn part_two(input: &str) -> Option<u32> {
+    None
+}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_part_one() {
+        let result = part_one(&advent_of_code::template::read_file("examples", DAY));
+        assert_eq!(result, Some(6));
+    }
+
+    #[test]
+    fn test_part_two() {
+        let result = part_two(&advent_of_code::template::read_file("examples", DAY));
+        assert_eq!(result, None);
+    }
+}