--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/day3.rb	Sun Dec 03 16:07:25 2023 +0000
@@ -0,0 +1,59 @@
+#! /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]
+
+number_chars = *('0'..'9')
+skip_chars = ['.']
+
+numbers = Hash.new
+symbols = Array.new
+Position = Struct.new(:x, :y)
+NumberValue = Struct.new(:value, :positions)
+SymbolValue = Struct.new(:position)
+
+def create_number_position(vals)
+	number = vals.reduce("") {|m, v| m + v[0]}.to_i
+	positions = vals.map {|v| Position.new(v[1], v[2])}
+	NumberValue.new(number, positions)
+end
+
+def adjacent(a, b)
+	(a.x - b.x).abs <= 1 and (a.y - b.y).abs <= 1
+end
+
+sum = 0
+positions = File.open(file, "r").each_line(chomp: true).with_index.map do |line, index|
+	numbers = line.each_char.with_index.map {|c, i| if number_chars.include? c or !skip_chars.include? c then [c, index, i] end }\
+		.filter {|v| v != nil }\
+		.reduce([[], []]) do |memo, val| 
+			if number_chars.include? val[0] then 
+				if memo[1].last and memo[1].last[2] + 1 != val[2] then 
+					memo[0] << create_number_position(memo[1])
+					memo[1] = []
+				end
+				memo[1] << val
+			else
+				if memo[1] != [] then
+					memo[0] << create_number_position(memo[1])
+					memo[1] = []
+				end
+				memo[0] << SymbolValue.new(Position.new(val[1], val[2]))
+			end
+			memo
+		end
+	if numbers[1] != [] then
+		numbers[0] << create_number_position(numbers[1])
+	end
+	numbers[0]
+end.flatten.group_by {|elem| elem.class}
+
+symbol_pos = positions[SymbolValue]
+number_pos = positions[NumberValue]
+
+puts number_pos.filter {|num| num.positions.any? {|num_pos| symbol_pos.any? { |sym_pos| adjacent(num_pos, sym_pos.position) } } }.sum {|v|v.value}

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/day3.txt	Sun Dec 03 16:07:25 2023 +0000
@@ -0,0 +1,28 @@
+You and the Elf eventually reach a gondola lift station; he says the gondola lift will take you up to the water source, but this is as far as he can bring you. You go inside.
+
+It doesn't take long to find the gondolas, but there seems to be a problem: they're not moving.
+
+"Aaah!"
+
+You turn around to see a slightly-greasy Elf with a wrench and a look of surprise. "Sorry, I wasn't expecting anyone! The gondola lift isn't working right now; it'll still be a while before I can fix it." You offer to help.
+
+The engineer explains that an engine part seems to be missing from the engine, but nobody can figure out which one. If you can add up all the part numbers in the engine schematic, it should be easy to work out which part is missing.
+
+The engine schematic (your puzzle input) consists of a visual representation of the engine. There are lots of numbers and symbols you don't really understand, but apparently any number adjacent to a symbol, even diagonally, is a "part number" and should be included in your sum. (Periods (.) do not count as a symbol.)
+
+Here is an example engine schematic:
+
+467..114..
+...*......
+..35..633.
+......#...
+617*......
+.....+.58.
+..592.....
+......755.
+...$.*....
+.664.598..
+
+In this schematic, two numbers are not part numbers because they are not adjacent to a symbol: 114 (top right) and 58 (middle right). Every other number is adjacent to a symbol and so is a part number; their sum is 4361.
+
+Of course, the actual engine schematic is much larger. What is the sum of all of the part numbers in the engine schematic?
\ No newline at end of file

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/day3b.rb	Sun Dec 03 16:07:25 2023 +0000
@@ -0,0 +1,59 @@
+#! /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]
+
+number_chars = *('0'..'9')
+skip_chars = ['.']
+
+numbers = Hash.new
+symbols = Array.new
+Position = Struct.new(:x, :y)
+NumberValue = Struct.new(:value, :positions)
+SymbolValue = Struct.new(:value, :position)
+
+def create_number_position(vals)
+	number = vals.reduce("") {|m, v| m + v[0]}.to_i
+	positions = vals.map {|v| Position.new(v[1], v[2])}
+	NumberValue.new(number, positions)
+end
+
+def adjacent(a, b)
+	(a.x - b.x).abs <= 1 and (a.y - b.y).abs <= 1
+end
+
+sum = 0
+positions = File.open(file, "r").each_line(chomp: true).with_index.map do |line, index|
+	numbers = line.each_char.with_index.map {|c, i| if number_chars.include? c or !skip_chars.include? c then [c, index, i] end }\
+		.filter {|v| v != nil }\
+		.reduce([[], []]) do |memo, val| 
+			if number_chars.include? val[0] then 
+				if memo[1].last and memo[1].last[2] + 1 != val[2] then 
+					memo[0] << create_number_position(memo[1])
+					memo[1] = []
+				end
+				memo[1] << val
+			else
+				if memo[1] != [] then
+					memo[0] << create_number_position(memo[1])
+					memo[1] = []
+				end
+				memo[0] << SymbolValue.new(val[0], Position.new(val[1], val[2]))
+			end
+			memo
+		end
+	if numbers[1] != [] then
+		numbers[0] << create_number_position(numbers[1])
+	end
+	numbers[0]
+end.flatten.group_by {|elem| elem.class}
+
+symbol_pos = positions[SymbolValue]
+number_pos = positions[NumberValue]
+
+puts symbol_pos.filter {|sym| sym.value == "*"}.map {|sym| number_pos.filter {|num| num.positions.any? {|num_pos| adjacent(num_pos, sym.position)}}}.filter {|nums| nums.length == 2}.map {|val| val.reduce(1) {|v, k| v * k.value}}.reduce(:+)
\ No newline at end of file