adam/AdventOfCode
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

2024 Day 14: at least add a path for the program to complete

Browse source
This commit is contained in:
Adam Millerchip 2024-12-14 18:03:41 +09:00
parent 83d6f89769
commit aee0c29d53
1 changed files with 8 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
2024/day14.exs
View file

@ -59,10 +59,10 @@ defmodule Day14 do
# manually: noticed things looked suspicious after 27 seconds # manually: noticed things looked suspicious after 27 seconds
# also noticed that repeated every 101 seconds # also noticed that repeated every 101 seconds
# Checked each 101 second jump until found the above tree # Checked each 101 second jump until found the above tree
tick_forever(robots, size_x, size_y) find_tree(robots, size_x, size_y)
end end
def tick_forever(robots, size_x, size_y, count \\ 27, acc \\ 27) do def find_tree(robots, size_x, size_y, count \\ 27, acc \\ 27) do
robots = tick(robots, size_x, size_y, count) robots = tick(robots, size_x, size_y, count)
robomap = MapSet.new(robots, fn [x, y, _, _] -> {x, y} end) robomap = MapSet.new(robots, fn [x, y, _, _] -> {x, y} end)
@ -78,9 +78,13 @@ defmodule Day14 do
IO.puts("|") IO.puts("|")
end end
IO.gets("#{acc} tree?") line = IO.gets("#{acc} tree [y/N]?")
tick_forever(robots, size_x, size_y, 101, acc + 101) if line |> String.trim() |> String.downcase() == "y" do
acc
else
find_tree(robots, size_x, size_y, 101, acc + 101)
end
end end
def tick(robots, size_x, size_y, times) do def tick(robots, size_x, size_y, times) do