Advent of Code 2023 - Day 7
Mix.install([
{:kino_aoc, "~> 0.1"}
])
Introduction
— Day 7: Camel Cards —
Your all-expenses-paid trip turns out to be a one-way, five-minute ride in an airship. (At least it’s a cool airship!) It drops you off at the edge of a vast desert and descends back to Island Island.
“Did you bring the parts?”
You turn around to see an Elf completely covered in white clothing, wearing goggles, and riding a large camel.
“Did you bring the parts?” she asks again, louder this time. You aren’t sure what parts she’s looking for; you’re here to figure out why the sand stopped.
“The parts! For the sand, yes! Come with me; I will show you.” She beckons you onto the camel.
After riding a bit across the sands of Desert Island, you can see what look like very large rocks covering half of the horizon. The Elf explains that the rocks are all along the part of Desert Island that is directly above Island Island, making it hard to even get there. Normally, they use big machines to move the rocks and filter the sand, but the machines have broken down because Desert Island recently stopped receiving the parts they need to fix the machines.
You’ve already assumed it’ll be your job to figure out why the parts stopped when she asks if you can help. You agree automatically.
Because the journey will take a few days, she offers to teach you the game of Camel Cards. Camel Cards is sort of similar to poker except it’s designed to be easier to play while riding a camel.
In Camel Cards, you get a list of hands, and your goal is to order them based on the strength of each hand. A hand consists of five cards labeled one of A
, K
, Q
, J
, T
, 9
, 8
, 7
, 6
, 5
, 4
, 3
, or 2
. The relative strength of each card follows this order, where A
is the highest and 2
is the lowest.
Every hand is exactly one type. From strongest to weakest, they are:
-
Five of a kind, where all five cards have the same label:
AAAAA
-
Four of a kind, where four cards have the same label and one card has a different label:
AA8AA
-
Full house, where three cards have the same label, and the remaining two cards share a different label:
23332
-
Three of a kind, where three cards have the same label, and the remaining two cards are each different from any other card in the hand:
TTT98
-
Two pair, where two cards share one label, two other cards share a second label, and the remaining card has a third label:
23432
-
One pair, where two cards share one label, and the other three cards have a different label from the pair and each other:
A23A4
-
High card, where all cards’ labels are distinct:
23456
Hands are primarily ordered based on type; for example, every full house is stronger than any three of a kind.
If two hands have the same type, a second ordering rule takes effect. Start by comparing the first card in each hand. If these cards are different, the hand with the stronger first card is considered stronger. If the first card in each hand have the same label, however, then move on to considering the second card in each hand. If they differ, the hand with the higher second card wins; otherwise, continue with the third card in each hand, then the fourth, then the fifth.
So, 33332
and 2AAAA
are both four of a kind hands, but 33332
is stronger because its first card is stronger. Similarly, 77888
and 77788
are both a full house, but 77888
is stronger because its third card is stronger (and both hands have the same first and second card).
To play Camel Cards, you are given a list of hands and their corresponding bid (your puzzle input). For example:
32T3K 765
T55J5 684
KK677 28
KTJJT 220
QQQJA 483
This example shows five hands; each hand is followed by its bid amount. Each hand wins an amount equal to its bid multiplied by its rank, where the weakest hand gets rank 1, the second-weakest hand gets rank 2, and so on up to the strongest hand. Because there are five hands in this example, the strongest hand will have rank 5 and its bid will be multiplied by 5.
So, the first step is to put the hands in order of strength:
-
32T3K
is the only one pair and the other hands are all a stronger type, so it gets rank 1. -
KK677
andKTJJT
are both two pair. Their first cards both have the same label, but the second card ofKK677
is stronger (K
vsT
), soKTJJT
gets rank 2 andKK677
gets rank 3. -
T55J5
andQQQJA
are both three of a kind.QQQJA
has a stronger first card, so it gets rank 5 andT55J5
gets rank 4.
Now, you can determine the total winnings of this set of hands by adding up the result of multiplying each hand’s bid with its rank (765
1 + 220
2 + 28
3 + 684
4 + 483
5). So the total winnings in this example are *6440
.
Find the rank of every hand in your set. What are the total winnings?
— Part Two —
To make things a little more interesting, the Elf introduces one additional rule. Now, J
cards are jokers - wildcards that can act like whatever card would make the hand the strongest type possible.
To balance this, J
cards are now the weakest individual cards, weaker even than 2
. The other cards stay in the same order: A
, K
, Q
, T
, 9
, 8
, 7
, 6
, 5
, 4
, 3
, 2
, J
.
J
cards can pretend to be whatever card is best for the purpose of determining hand type; for example, QJJQ2
is now considered four of a kind. However, for the purpose of breaking ties between two hands of the same type, J
is always treated as J
, not the card it’s pretending to be: JKKK2
is weaker than QQQQ2
because J
is weaker than Q
.
Now, the above example goes very differently:
32T3K 765
T55J5 684
KK677 28
KTJJT 220
QQQJA 483
-
32T3K
is still the only one pair; it doesn’t contain any jokers, so its strength doesn’t increase. -
KK677
is now the only two pair, making it the second-weakest hand. -
T55J5
,KTJJT
, andQQQJA
are now all four of a kind!T55J5
gets rank 3,QQQJA
gets rank 4, andKTJJT
gets rank 5.
With the new joker rule, the total winnings in this example are 5905
.
Using the new joker rule, find the rank of every hand in your set. What are the new total winnings?
Puzzle
{:ok, puzzle_input} =
KinoAOC.download_puzzle("2023", "7", System.fetch_env!("LB_AOC_SESSION"))
IO.puts(puzzle_input)
Parser
Code - Parser
defmodule Parser do
def parse(input) do
input
|> String.split("\n", trim: true)
|> Enum.map(&String.split(&1, " ", trim: true))
|> Enum.map(fn [hand, bid] ->
{hand, String.to_integer(bid)}
end)
end
end
Tests - Parser
ExUnit.start(autorun: false)
defmodule ParserTest do
use ExUnit.Case, async: true
import Parser
@input """
32T3K 765
T55J5 684
KK677 28
KTJJT 220
QQQJA 483
"""
@expected [
{"32T3K", 765},
{"T55J5", 684},
{"KK677", 28},
{"KTJJT", 220},
{"QQQJA", 483}
]
test "parse test" do
assert parse(@input) == @expected
end
end
ExUnit.run()
Part One
Code - Part 1
defmodule PartOne do
def solve(input) do
IO.puts("--- Part One ---")
IO.puts("Result: #{run(input)}")
end
@cards %{
"2" => 1,
"3" => 2,
"4" => 3,
"5" => 4,
"6" => 5,
"7" => 6,
"8" => 7,
"9" => 8,
"T" => 9,
"J" => 10,
"Q" => 11,
"K" => 12,
"A" => 13
}
def run(input) do
input
|> Parser.parse()
|> Enum.group_by(fn {cards, _} ->
amounts = cards |> String.codepoints() |> Enum.frequencies() |> Map.values()
cond do
5 in amounts and length(amounts) == 1 -> "6-five-kind"
4 in amounts and length(amounts) == 2 -> "5-four-kind"
3 in amounts and length(amounts) == 2 -> "4-full-house"
3 in amounts and length(amounts) == 3 -> "3-three-kind"
2 in amounts and length(amounts) == 3 -> "2-two-pair"
2 in amounts and length(amounts) == 4 -> "1-one-pair"
true -> "0-high-card"
end
end)
|> Map.values()
|> Enum.map(fn hand_list ->
hand_list
|> Enum.sort(fn {hand1, _}, {hand2, _} ->
Enum.zip(String.codepoints(hand1), String.codepoints(hand2))
|> Enum.reduce_while(false, fn {a, b}, acc ->
cond do
@cards[a] < @cards[b] -> {:halt, true}
@cards[a] > @cards[b] -> {:halt, false}
true -> {:cont, acc}
end
end)
end)
end)
|> List.flatten()
|> Enum.with_index(1)
|> Enum.map(fn {{_, bid}, weith} -> bid * weith end)
|> Enum.sum()
end
end
Tests - Part 1
ExUnit.start(autorun: false)
defmodule PartOneTest do
use ExUnit.Case, async: true
import PartOne
@input """
32T3K 765
T55J5 684
KK677 28
KTJJT 220
QQQJA 483
"""
@expected 6440
test "part one" do
assert run(@input) == @expected
end
end
ExUnit.run()
Solution - Part 1
PartOne.solve(puzzle_input)
Part Two
Code - Part 2
defmodule PartTwo do
def solve(input) do
IO.puts("--- Part Two ---")
IO.puts("Result: #{run(input)}")
end
@cards %{
"J" => 1,
"2" => 2,
"3" => 3,
"4" => 4,
"5" => 5,
"6" => 6,
"7" => 7,
"8" => 8,
"9" => 9,
"T" => 10,
"Q" => 11,
"K" => 12,
"A" => 13
}
def run(input) do
input
|> Parser.parse()
|> Enum.group_by(fn {cards, _} ->
{max_freq_card, _} =
cards
|> String.codepoints()
|> Enum.filter(&(&1 != "J"))
|> Enum.frequencies()
|> Enum.max_by(&elem(&1, 1), fn -> {"J", 1} end)
freq =
cards
|> String.codepoints()
|> Enum.frequencies_by(fn card ->
if card == "J", do: max_freq_card, else: card
end)
amounts = freq |> Map.values()
cond do
5 in amounts and length(amounts) == 1 -> "6-five-kind"
4 in amounts and length(amounts) == 2 -> "5-four-kind"
3 in amounts and length(amounts) == 2 -> "4-full-house"
3 in amounts and length(amounts) == 3 -> "3-three-kind"
2 in amounts and length(amounts) == 3 -> "2-two-pair"
2 in amounts and length(amounts) == 4 -> "1-one-pair"
true -> "0-high-card"
end
end)
|> Map.values()
|> Enum.map(fn hand_list ->
hand_list
|> Enum.sort(fn {hand1, _}, {hand2, _} ->
Enum.zip(String.codepoints(hand1), String.codepoints(hand2))
|> Enum.reduce_while(false, fn {a, b}, acc ->
cond do
@cards[a] < @cards[b] -> {:halt, true}
@cards[a] > @cards[b] -> {:halt, false}
true -> {:cont, acc}
end
end)
end)
end)
|> List.flatten()
|> Enum.with_index(1)
|> Enum.map(fn {{_, bid}, weith} -> bid * weith end)
|> Enum.sum()
end
end
Tests - Part 2
ExUnit.start(autorun: false)
defmodule PartTwoTest do
use ExUnit.Case, async: true
import PartTwo
@input """
32T3K 765
T55J5 684
KK677 28
KTJJT 220
QQQJA 483
"""
@expected 5905
test "part two" do
assert run(@input) == @expected
end
end
ExUnit.run()
Solution - Part 2
PartTwo.solve(puzzle_input)