view day11.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 ddb69833346c
children
line wrap: on
line source

#! /usr/bin/env ruby

if ARGV.length != 1
        abort("Incorrect arguments - needs input file")
elsif not File.exist? (ARGV[0])
	abort("File #{ARGV[0]} did not exist")
end

file = ARGV[0]

OPEN_SPACE = "."
GALAXY = "#"

input_space = File.open(file, "r").each_line(chomp: true).map(&:each_char).map(&:to_a)

first, *rest = input_space
open_columns = first.zip(*rest).map {|col| col.all? {|cell| cell == OPEN_SPACE}}

expanded_space = input_space.flat_map do |row|
	new_row = row.zip(open_columns).flat_map {|cell, is_open| is_open ? [cell, cell] : [cell]}
	if row.all? {|cell| cell == OPEN_SPACE} then [new_row, new_row] else [new_row] end
end

galaxies = expanded_space.each_with_index.flat_map {|row, y| row.each_with_index.map {|cell, x| [x, y] if cell == GALAXY}}.compact
galactic_distances = galaxies.combination(2).map {|a, b| (a[0] - b[0]).abs + (a[1] - b[1]).abs}
puts galactic_distances.sum