advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/eregon/2019/13_2.yml

@@ -0,0 +1,360 @@
+---
+- :name: 13b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2019
+  :solution: |-
+    input = File.read('13.txt')
+    code = input.chomp.split(',').map { |e| Integer(e) }.freeze
+
+    def interpreter(memory, input, output)
+      memory = memory.dup
+      def memory.[](i)
+        raise if i < 0
+        super(i) || 0
+      end
+      ip = 0
+      mode = 0
+      relative_base = 0
+
+      get_mode = -> i {
+        mode / (10 ** (i-1)) % 10
+      }
+
+      read = -> i {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v]
+        when 1 # immediate
+          v
+        when 2 # relative
+          memory[relative_base + v]
+        else
+          raise "Unknown read mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      write = -> i, result {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v] = result
+        when 2 # relative
+          memory[relative_base + v] = result
+        else
+          raise "Unknown write mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      while true
+        instruction = memory[ip]
+        mode, opcode = instruction.divmod(100)
+        case opcode
+        when 1 # add
+          write[3, read[1] + read[2]]
+          ip += 4
+        when 2 # multiply
+          write[3, read[1] * read[2]]
+          ip += 4
+        when 3 # input
+          write[1, input.call]
+          ip += 2
+        when 4 # output
+          output.call(read[1])
+          ip += 2
+        when 5 # jump-if-true
+          ip = read[1] != 0 ? read[2] : ip + 3
+        when 6 # jump-if-false
+          ip = read[1] == 0 ? read[2] : ip + 3
+        when 7 # less than
+          write[3, read[1] < read[2] ? 1 : 0]
+          ip += 4
+        when 8 # equals
+          write[3, read[1] == read[2] ? 1 : 0]
+          ip += 4
+        when 9 # relative base offset
+          relative_base += read[1]
+          ip += 2
+        when 99
+          break
+        else
+          raise "Unknown opcode: #{opcode} at #{ip} (#{instruction})"
+        end
+      end
+    end
+
+    TYPES = [' ', '#', '+', 'T', '*']
+    DIRS = %w[a s d]
+    tiles = Hash.new(TYPES[0])
+
+    f = Fiber.new do
+      memory = code.dup
+      memory[0] = 2
+      interpreter(memory, -> {
+        ball = tiles.key('*')
+        paddle = tiles.key('T')
+        ball.real <=> paddle.real
+      }, -> r { Fiber.yield(r) })
+      nil
+    end
+
+    score = 0
+    while x = f.resume
+      y = f.resume
+      id = f.resume
+      if x < 0
+        score = id
+      else
+        tiles[x + y.i] = TYPES[id]
+      end
+    end
+    p score
+- :name: 13b_ai.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2019
+  :solution: |-
+    input = File.read('13.txt')
+    code = input.chomp.split(',').map { |e| Integer(e) }.freeze
+
+    def interpreter(memory, input, output)
+      memory = memory.dup
+      def memory.[](i)
+        raise if i < 0
+        super(i) || 0
+      end
+      ip = 0
+      mode = 0
+      relative_base = 0
+
+      get_mode = -> i {
+        mode / (10 ** (i-1)) % 10
+      }
+
+      read = -> i {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v]
+        when 1 # immediate
+          v
+        when 2 # relative
+          memory[relative_base + v]
+        else
+          raise "Unknown read mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      write = -> i, result {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v] = result
+        when 2 # relative
+          memory[relative_base + v] = result
+        else
+          raise "Unknown write mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      while true
+        instruction = memory[ip]
+        mode, opcode = instruction.divmod(100)
+        case opcode
+        when 1 # add
+          write[3, read[1] + read[2]]
+          ip += 4
+        when 2 # multiply
+          write[3, read[1] * read[2]]
+          ip += 4
+        when 3 # input
+          write[1, input.call]
+          ip += 2
+        when 4 # output
+          output.call(read[1])
+          ip += 2
+        when 5 # jump-if-true
+          ip = read[1] != 0 ? read[2] : ip + 3
+        when 6 # jump-if-false
+          ip = read[1] == 0 ? read[2] : ip + 3
+        when 7 # less than
+          write[3, read[1] < read[2] ? 1 : 0]
+          ip += 4
+        when 8 # equals
+          write[3, read[1] == read[2] ? 1 : 0]
+          ip += 4
+        when 9 # relative base offset
+          relative_base += read[1]
+          ip += 2
+        when 99
+          break
+        else
+          raise "Unknown opcode: #{opcode} at #{ip} (#{instruction})"
+        end
+      end
+    end
+
+    TYPES = [' ', '#', '+', 'T', '*']
+    DIRS = %w[a s d]
+    tiles = Hash.new(TYPES[0])
+
+    f = Fiber.new do
+      memory = code.dup
+      memory[0] = 2
+      interpreter(memory, -> {
+        ball = tiles.key('*')
+        paddle = tiles.key('T')
+        ball.real <=> paddle.real
+      }, -> r { Fiber.yield(r) })
+      nil
+    end
+
+    while x = f.resume
+      y = f.resume
+      id = f.resume
+      if x == -1 and y == 0
+        puts "Score: #{id}"
+      else
+        prev = tiles[x + y.i]
+        if id == 0 and prev == '*'
+          tiles[x + y.i] = '.'
+        else
+          tiles[x + y.i] = TYPES[id]
+        end
+      end
+
+      puts "\n" * 50 + Range.new(*tiles.keys.map(&:imag).minmax).map { |y|
+        Range.new(*tiles.keys.map(&:real).minmax).map { |x|
+          tiles[x + y.i]
+        }.join
+      }.join("\n")
+    end
+- :name: 13b_play.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2019
+  :solution: |-
+    input = File.read('13.txt')
+    code = input.chomp.split(',').map { |e| Integer(e) }.freeze
+
+    def interpreter(memory, input, output)
+      memory = memory.dup
+      def memory.[](i)
+        raise if i < 0
+        super(i) || 0
+      end
+      ip = 0
+      mode = 0
+      relative_base = 0
+
+      get_mode = -> i {
+        mode / (10 ** (i-1)) % 10
+      }
+
+      read = -> i {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v]
+        when 1 # immediate
+          v
+        when 2 # relative
+          memory[relative_base + v]
+        else
+          raise "Unknown read mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      write = -> i, result {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v] = result
+        when 2 # relative
+          memory[relative_base + v] = result
+        else
+          raise "Unknown write mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      while true
+        instruction = memory[ip]
+        mode, opcode = instruction.divmod(100)
+        case opcode
+        when 1 # add
+          write[3, read[1] + read[2]]
+          ip += 4
+        when 2 # multiply
+          write[3, read[1] * read[2]]
+          ip += 4
+        when 3 # input
+          write[1, input.call]
+          ip += 2
+        when 4 # output
+          output.call(read[1])
+          ip += 2
+        when 5 # jump-if-true
+          ip = read[1] != 0 ? read[2] : ip + 3
+        when 6 # jump-if-false
+          ip = read[1] == 0 ? read[2] : ip + 3
+        when 7 # less than
+          write[3, read[1] < read[2] ? 1 : 0]
+          ip += 4
+        when 8 # equals
+          write[3, read[1] == read[2] ? 1 : 0]
+          ip += 4
+        when 9 # relative base offset
+          relative_base += read[1]
+          ip += 2
+        when 99
+          break
+        else
+          raise "Unknown opcode: #{opcode} at #{ip} (#{instruction})"
+        end
+      end
+    end
+
+    require 'io/console'
+
+    TYPES = [' ', '#', '+', 'T', '*']
+    DIRS = %w[a s d]
+    tiles = Hash.new(TYPES[0])
+
+    saved_inputs = File.new('input13.txt', 'a')
+    saved_inputs.sync = true
+    inputs = File.readlines('input13.txt', chomp: true)
+
+    f = Fiber.new do
+      memory = code.dup
+      memory[0] = 2
+      interpreter(memory, -> {
+        if !inputs.empty?
+          input = inputs.shift
+        else
+          begin
+            input = STDIN.getch
+            exit if input == 'q'
+          end until DIRS.include?(input)
+          saved_inputs.puts input
+        end
+
+        DIRS.index(input) - 1
+      }, -> r { Fiber.yield(r) })
+      nil
+    end
+
+    while x = f.resume
+      y = f.resume
+      id = f.resume
+      if x == -1 and y == 0
+        puts "Score: #{id}"
+      else
+        prev = tiles[x + y.i]
+        if id == 0 and prev == '*'
+          tiles[x + y.i] = '.'
+        else
+          tiles[x + y.i] = TYPES[id]
+        end
+      end
+
+      puts "\n" * 50 + Range.new(*tiles.keys.map(&:imag).minmax).map { |y|
+        Range.new(*tiles.keys.map(&:real).minmax).map { |x|
+          tiles[x + y.i]
+        }.join
+      }.join("\n")
+    end

data/data/solutions/github/eregon/2019/14_1.yml

@@ -0,0 +1,36 @@
+---
+- :name: 14a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2019
+  :solution: |-
+    input = File.read('14.txt')
+
+    reactions = {}
+    input.each_line { |line|
+      inputs, output = line.split(' => ', 2)
+      n, out = output.split.then { |n,out| [Integer(n), out.to_sym] }
+      raise output if reactions.key? out
+      reactions[out.to_sym] = [
+        Integer(n),
+        inputs.split(', ').map { |input|
+          q, c = input.split
+          [Integer(q), c.to_sym]
+        }
+      ]
+    }
+
+    needed_ore = 0
+    available = { FUEL: -1 }.tap { |h| h.default = 0 }
+
+    while missing = available.each_pair.find { |c,q| q < 0 }
+      chemical, needed = missing
+      if chemical == :ORE
+        needed_ore += needed.abs
+        available[:ORE] = 0
+      else
+        produced, inputs = reactions.fetch(chemical)
+        inputs.each { |q,c| available[c] -= q }
+        available[chemical] += produced
+      end
+    end
+
+    p needed_ore

data/data/solutions/github/eregon/2019/14_2.yml

@@ -0,0 +1,37 @@
+---
+- :name: 14b.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2019
+  :solution: |-
+    input = File.read('14.txt')
+
+    reactions = {}
+    input.each_line { |line|
+      inputs, output = line.split(' => ', 2)
+      n, out = output.split.then { |n,out| [Integer(n), out.to_sym] }
+      raise output if reactions.key? out
+      reactions[out.to_sym] = [
+        Integer(n),
+        inputs.split(', ').map { |input|
+          q, c = input.split
+          [Integer(q), c.to_sym]
+        }
+      ]
+    }
+
+    MAX_ORE = 1_000_000_000_000
+
+    p (1..MAX_ORE).bsearch { |fuel|
+      available = { FUEL: -fuel, ORE: MAX_ORE }.tap { |h| h.default = 0 }
+
+      while missing = available.each_pair.find { |c,q| q < 0 }
+        chemical, needed = missing
+        break if chemical == :ORE
+
+        produced, inputs = reactions.fetch(chemical)
+        multiplier = (needed.abs + (produced-1)) / produced
+        inputs.each { |q,c| available[c] -= q * multiplier }
+        available[chemical] += produced * multiplier
+      end
+
+      available[:ORE] < 0
+    } - 1

data/data/solutions/github/eregon/2019/15_1.yml

@@ -0,0 +1,272 @@
+---
+- :name: 15a.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2019
+  :solution: |-
+    input = File.read('15.txt')
+    code = input.chomp.split(',').map { |e| Integer(e) }.freeze
+
+    def interpreter(memory, input, output)
+      memory = memory.dup
+      def memory.[](i)
+        raise if i < 0
+        super(i) || 0
+      end
+      ip = 0
+      mode = 0
+      relative_base = 0
+
+      get_mode = -> i {
+        mode / (10 ** (i-1)) % 10
+      }
+
+      read = -> i {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v]
+        when 1 # immediate
+          v
+        when 2 # relative
+          memory[relative_base + v]
+        else
+          raise "Unknown read mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      write = -> i, result {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v] = result
+        when 2 # relative
+          memory[relative_base + v] = result
+        else
+          raise "Unknown write mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      while true
+        instruction = memory[ip]
+        mode, opcode = instruction.divmod(100)
+        case opcode
+        when 1 # add
+          write[3, read[1] + read[2]]
+          ip += 4
+        when 2 # multiply
+          write[3, read[1] * read[2]]
+          ip += 4
+        when 3 # input
+          write[1, input.call]
+          ip += 2
+        when 4 # output
+          output.call(read[1])
+          ip += 2
+        when 5 # jump-if-true
+          ip = read[1] != 0 ? read[2] : ip + 3
+        when 6 # jump-if-false
+          ip = read[1] == 0 ? read[2] : ip + 3
+        when 7 # less than
+          write[3, read[1] < read[2] ? 1 : 0]
+          ip += 4
+        when 8 # equals
+          write[3, read[1] == read[2] ? 1 : 0]
+          ip += 4
+        when 9 # relative base offset
+          relative_base += read[1]
+          ip += 2
+        when 99
+          break
+        else
+          raise "Unknown opcode: #{opcode} at #{ip} (#{instruction})"
+        end
+      end
+    end
+
+    require 'io/console'
+
+    # north (1), south (2), west (3), and east (4)
+    DIRS = [nil, -1i, 1i, -1, 1]
+    KEYS = [nil, 'w', 's', 'a', 'd']
+    STATUSES = ['#', '.', 'O']
+
+    tiles = Hash.new(' ')
+
+    f = Fiber.new do
+      interpreter(code, -> { Fiber.yield(:input) }, -> r { Fiber.yield(r) })
+      nil
+    end
+
+    pos = 0 + 0i
+    tiles[pos] = '.'
+
+    dirs = (1..4).to_a
+    searching = true
+    steps = 0
+
+    while true
+      r = f.resume
+      raise r.inspect unless r == :input
+
+      if searching
+        dir = dirs.sample
+      else
+        begin
+          input = STDIN.getch
+          exit if input == 'q'
+        end until KEYS.include?(input)
+        dir = KEYS.index(input)
+      end
+
+      status = f.resume dir
+      status = STATUSES.fetch(status)
+
+      tiles[pos + DIRS[dir]] = status
+
+      if status == '.'
+        pos += DIRS[dir]
+        steps += 1
+      elsif status == 'O'
+        pos += DIRS[dir]
+        searching = false
+        puts "Time to go back"
+        steps = 0
+      end
+
+      if !searching and pos == 0 + 0.i
+        break
+      end
+
+      puts "\n" * 2 + Range.new(*tiles.keys.map(&:imag).minmax).map { |y|
+        Range.new(*tiles.keys.map(&:real).minmax).map { |x|
+          x == 0 && y == 0 ? 'S' : x + y.i == pos ? 'D' : tiles[x + y.i]
+        }.join
+      }.join("\n")
+      p steps unless searching
+    end
+
+    p steps
+- :name: 15a_play.rb
+  :url: https://github.com/eregon/adventofcode/blob/master/2019
+  :solution: |-
+    input = File.read('15.txt')
+    code = input.chomp.split(',').map { |e| Integer(e) }.freeze
+
+    def interpreter(memory, input, output)
+      memory = memory.dup
+      def memory.[](i)
+        raise if i < 0
+        super(i) || 0
+      end
+      ip = 0
+      mode = 0
+      relative_base = 0
+
+      get_mode = -> i {
+        mode / (10 ** (i-1)) % 10
+      }
+
+      read = -> i {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v]
+        when 1 # immediate
+          v
+        when 2 # relative
+          memory[relative_base + v]
+        else
+          raise "Unknown read mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      write = -> i, result {
+        v = memory[ip + i]
+        case m = get_mode[i]
+        when 0 # position
+          memory[v] = result
+        when 2 # relative
+          memory[relative_base + v] = result
+        else
+          raise "Unknown write mode #{m} (#{mode} #{i})"
+        end
+      }
+
+      while true
+        instruction = memory[ip]
+        mode, opcode = instruction.divmod(100)
+        case opcode
+        when 1 # add
+          write[3, read[1] + read[2]]
+          ip += 4
+        when 2 # multiply
+          write[3, read[1] * read[2]]
+          ip += 4
+        when 3 # input
+          write[1, input.call]
+          ip += 2
+        when 4 # output
+          output.call(read[1])
+          ip += 2
+        when 5 # jump-if-true
+          ip = read[1] != 0 ? read[2] : ip + 3
+        when 6 # jump-if-false
+          ip = read[1] == 0 ? read[2] : ip + 3
+        when 7 # less than
+          write[3, read[1] < read[2] ? 1 : 0]
+          ip += 4
+        when 8 # equals
+          write[3, read[1] == read[2] ? 1 : 0]
+          ip += 4
+        when 9 # relative base offset
+          relative_base += read[1]
+          ip += 2
+        when 99
+          break
+        else
+          raise "Unknown opcode: #{opcode} at #{ip} (#{instruction})"
+        end
+      end
+    end
+
+    require 'io/console'
+
+    # north (1), south (2), west (3), and east (4)
+    DIRS = [nil, -1i, 1i, -1, 1]
+    KEYS = [nil, 'w', 's', 'a', 'd']
+    STATUSES = ['#', '.', 'O']
+
+    tiles = Hash.new(' ')
+
+    f = Fiber.new do
+      interpreter(code, -> { Fiber.yield(:input) }, -> r { Fiber.yield(r) })
+      nil
+    end
+
+    pos = 0 + 0i
+    tiles[pos] = '.'
+
+    while true
+      r = f.resume
+      raise r.inspect unless r == :input
+
+      begin
+        input = STDIN.getch
+        exit if input == 'q'
+      end until KEYS.include?(input)
+      dir = KEYS.index(input)
+
+      status = f.resume dir
+      status = STATUSES.fetch(status)
+
+      tiles[pos + DIRS[dir]] = status
+
+      if status == '.' or status == 'O'
+        pos += DIRS[dir]
+      end
+
+      puts "\n" * 2 + Range.new(*tiles.keys.map(&:imag).minmax).map { |y|
+        Range.new(*tiles.keys.map(&:real).minmax).map { |x|
+          x + y.i == pos ? 'D' : tiles[x + y.i]
+        }.join
+      }.join("\n")
+    end

data/data/solutions/github/eregon/2019/15_2.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2019/16_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/eregon/2019/16_2.yml

@@ -0,0 +1 @@
+--- []