1
0
Fork 0

2021 day 21

This commit is contained in:
Sloane Perrault 2022-09-21 09:19:54 -04:00
parent bc11317400
commit ac5fd19a42
2 changed files with 49 additions and 2 deletions

View file

@ -17,7 +17,7 @@
| | | | [1] | [2] | [3] | [4] |
| [5] | [6] | [7] | [8] | [9] | [10] | [11]|
| [12]| [13]| [14]| [15] | [16] | [17] | [18] |
| [19] | 20 | 21 | 22 | 23 | 24 | 25 |
| [19] | 20 | [21] | 22 | 23 | 24 | 25 |
<!-- links -->
@ -40,3 +40,5 @@
[17]: ./lib/2021/17.ex
[18]: ./lib/2021/18.ex
[19]: ./lib/2021/19.ex
[21]: ./lib/2021/21.ex

View file

@ -11,8 +11,52 @@ aoc 2021, 21 do
end
def p2 do
input_players()
|> run_dirac_dice_game()
|> Tuple.to_list()
|> Enum.max()
end
@dirac_dice_winning_score 21
@quantum_rolls %{ 3 => 1, 4 => 3, 5 => 6, 6 => 7, 7 => 6, 8 => 3, 9 => 1 }
def run_dirac_dice_game(players, up_to_play \\ :player_1)
def run_dirac_dice_game({{_, player_1_score}, _}, :player_2) when player_1_score >= @dirac_dice_winning_score, do: {1, 0}
def run_dirac_dice_game({_, {_, player_2_score}}, :player_1) when player_2_score >= @dirac_dice_winning_score, do: {0, 1}
def run_dirac_dice_game({player_1, player_2}, :player_1) do
for {player_1, freq} <- quantum_move(player_1) do
run_dirac_dice_game({player_1, player_2}, :player_2)
|> multiply_by(freq)
|> compact()
end
|> compact()
end
def run_dirac_dice_game({player_1, player_2}, :player_2) do
for {player_2, freq} <- quantum_move(player_2) do
run_dirac_dice_game({player_1, player_2}, :player_1)
|> multiply_by(freq)
|> compact()
end
|> compact()
end
def quantum_move(player) do
for {roll, freq} <- @quantum_rolls do
{move(player, roll), freq}
end
end
def multiply_by(xs, c) when is_list(xs), do: Enum.map(xs, &multiply_by(&1, c))
def multiply_by({a, b}, c), do: {a * c, b * c}
def compact(xs) when is_list(xs) do
{as, bs} = Enum.unzip(xs)
{Enum.sum(as), Enum.sum(bs)}
end
def compact(tp) when is_tuple(tp), do: tp
def play_game(players, die, winning_score \\ 1000) do
Enum.reduce_while(rolls(die), {0, players}, fn
roll, {roll_count, {player, other_player}} ->
@ -24,8 +68,9 @@ aoc 2021, 21 do
end)
end
def move(player, rolls) when is_list(rolls), do: move(player, Enum.sum(rolls))
def move({position, score}, roll) do
position = (position + Enum.sum(roll)) |> to_board_position()
position = to_board_position(position + roll)
score = score + position
{position, score}