Mercurial > repos > other > adventofcode2023
view day2.rb @ 26:eb6c3a7d2f72
Constrained and more optimised route finding
* Track routes so we can see if we have gone straight for
too long
* Track multiple routes so we can use a non-optimal route to
X if it makes another route to Y through X possible (e.g.
optimal route takes three consecutive steps to X, but then
has to turn, whereas a longer straight earlier and two
consecutive steps to X gives a much better next hop to Y)
* We have a start point, so only include the nodes from the
search front in "unvisited" to avoid looking at lots of
irrelevant nodes
author | IBBoard <dev@ibboard.co.uk> |
---|---|
date | Sun, 17 Dec 2023 20:13:03 +0000 |
parents | 49dd1ae93696 |
children |
line wrap: on
line source
#! /usr/bin/env ruby if ARGV.length != 4 abort("Incorrect arguments - needs numbers for Red, Green and Blue then input file") elsif not File.exist? (ARGV[3]) abort("File #{ARGV[3]} did not exist") end max_colours = { "red" => ARGV[0].to_i, "green" => ARGV[1].to_i, "blue" => ARGV[2].to_i } file = ARGV[3] sum = 0 File.open(file, "r").each_line do |line| game, all_picks = line.split(":") all_valid = all_picks.split(";").all? do |pick| pick.split(",").all? do |colour_pick| num_picked, colour_picked = colour_pick.strip.split(" ") # The last line of a Ruby block is the return value num_picked.to_i <= max_colours[colour_picked] end end if all_valid puts game sum += game.split(" ")[1].to_i end end puts sum