view day9b.rb @ 30:6de4f4d5404d

Implement Day 21 "possible spaces in a maze" Part 2 needs something like "find the repeats and lowest common multiple" that I'm not bothering with
author IBBoard <dev@ibboard.co.uk>
date Wed, 03 Jan 2024 12:01:18 +0000
parents 891878e52a31
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]

histories = File.open(file, "r").each_line(chomp: true).map {|line| line.split(" ").map(&:to_i)}

def diff_array(arr)
	arr.each_cons(2)
	
end

predictions = histories.map do |history|
	vals = history
	layers = [history]
	while not vals.all? {|v| v == 0}
		vals = vals.each_cons(2).map {|a,b| b - a}
		layers << vals
	end
	layers.reverse!.each_cons(2).map {|diffs, vals| vals.insert(0, vals[0] - diffs[0])}
	layers[-1][0]
end

puts predictions.sum
# Rest of algorithm here