advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/ZogStriP/2021/14_2.yml

@@ -0,0 +1,20 @@
+---
+- :name: 14_extended_polymerization.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    polymer, rules = DATA.read.split("\n\n")
+    rules = rules.split("\n").to_h { _1.split(" -> ") }
+
+    solos = polymer.chars.tally
+    pairs = polymer.chars.each_cons(2).map(&:join).tally
+
+    p *[10, 30].map { |n|
+      n.times {
+        pairs = pairs.each_with_object(Hash.new(0)) { |(k, v), p|
+          p[k[0] + rules[k]] += v
+          p[rules[k] + k[1]] += v
+          solos[rules[k]] += v
+        }
+      }
+      -solos.values.minmax.reduce(:-)
+    }

data/data/solutions/github/ZogStriP/2021/15_1.yml

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

data/data/solutions/github/ZogStriP/2021/15_2.yml

@@ -0,0 +1,31 @@
+---
+- :name: 15_chiton.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    require_relative "priority_queue"
+
+    M = DATA.map { _1.chomp.chars.map &:to_i }
+    R = M.flatten
+    H = M.size
+    W = M[0].size
+    HH = H * 5
+    WW = W * 5
+    E = HH * WW - 1
+
+    d = Hash.new(1.0 / 0)
+    q = PriorityQueue.new
+    q.push(0, d[0] = 0)
+
+    r = -> y, x { 1 + (R[(y % H) * W + x % W] + y / H + x / W - 1) % 9 }
+
+    while c = q.pop
+      y, x = c.divmod(WW)
+      n = []
+      n << [c - WW, r[y - 1, x]] if y > 0
+      n << [c + WW, r[y + 1, x]] if y < HH - 1
+      n << [c -  1, r[y, x - 1]] if x > 0
+      n << [c +  1, r[y, x + 1]] if x < WW - 1
+      n.each { q.push(_1, d[_1] = d[c] + _2) if d[_1] > d[c] + _2 }
+    end
+
+    p d[(H-1)*WW+W-1], d[E]

data/data/solutions/github/ZogStriP/2021/16_1.yml

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

data/data/solutions/github/ZogStriP/2021/16_2.yml

@@ -0,0 +1,56 @@
+---
+- :name: 16_packet_decoder.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    int = -> b { b.join.to_i(2) }
+
+    parse = -> bits {
+      version = int[bits.shift(3)]
+      type_id = int[bits.shift(3)]
+
+      if 4 == type_id
+        b = []
+
+        loop {
+          stop = bits.shift
+          b.concat bits.shift(4)
+          break if stop[?0]
+        }
+
+        return [type_id, version, int[b]]
+      end
+
+      length_type_id = bits.shift
+
+      packets = if length_type_id[?0]
+        length = int[bits.shift(15)]
+        b = bits.shift(length)
+        p = []
+        p << parse[b] while b.size > 0
+        p
+      else
+        count = int[bits.shift(11)]
+        count.times.map { parse[bits] }
+      end
+
+      [type_id, version, packets]
+    }
+
+    vn = -> t { t[0] == 4 ? t[1] : t[1] + t[2].sum { vn[_1] } }
+
+    ev = -> t {
+      case t[0]
+      when 0; t[2].map { ev[_1] }.sum
+      when 1; t[2].map { ev[_1] }.reduce(:*)
+      when 2; t[2].map { ev[_1] }.min
+      when 3; t[2].map { ev[_1] }.max
+      when 4; t[2]
+      when 5; ev[t[2][0]]  > ev[t[2][1]] ? 1 : 0
+      when 6; ev[t[2][0]]  < ev[t[2][1]] ? 1 : 0
+      when 7; ev[t[2][0]] == ev[t[2][1]] ? 1 : 0
+      end
+    }
+
+    T = parse[DATA.each_char.map { "%04b" % _1.hex }.join.chars]
+
+    p vn[T], ev[T]

data/data/solutions/github/ZogStriP/2021/17_1.yml

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

data/data/solutions/github/ZogStriP/2021/17_2.yml

@@ -0,0 +1,4 @@
+---
+- :name: 17_trick_shot.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: "X, Y = DATA.read.scan(/-?\\d+\\.\\.-?\\d+/).map { eval _1 }\n\nfire = -> dx, dy {\n    \U0001F4A5, x, y, ymax = false, 0, 0, 0\n\n    loop {\n      x += dx; dx -= 1 if dx > 0\n      y += dy; dy -= 1\n      ymax = [ymax, y].max\n      break \U0001F4A5 = true if X === x && Y === y\n      break if y <= Y.min\n    }\n\n    [\U0001F4A5, ymax]\n}\n\nhits = [*(1..X.max)].product([*(Y.min..-Y.min)]).map { fire[_1, _2] }.filter &:first\n\np hits.map(&:last).max, hits.size"

data/data/solutions/github/ZogStriP/2021/18_1.yml

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

data/data/solutions/github/ZogStriP/2021/18_2.yml

@@ -0,0 +1,4 @@
+---
+- :name: 18_snailfish.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: "lines = DATA.map { eval _1 }\n\nadd_left = -> x, n {\n  return x if !n\n  return x + n if Integer === x\n  [add_left[x[0], n], x[1]]\n}\n\nadd_right = -> x, n {\n  return x if !n\n  return x + n if Integer === x\n  [x[0], add_right[x[1], n]]\n}\n\nexplode = -> x, n=4 {\n  return [false, nil, x, nil] if Integer === x\n  return [true, x[0], 0, x[1]] if n == 0\n  a, b = x\n  \U0001F4A5, left, a, right = explode[a, n - 1]\n  return [true, left, [a, add_left[b, right]], nil] if \U0001F4A5\n  \U0001F4A5, left, b, right = explode[b, n - 1]\n  return [true, nil, [add_right[a, left], b], right] if \U0001F4A5\n  [false, nil, x, nil]\n}\n\nsplit = -> x {\n  return (x > 9 ? [true, [x / 2, (x / 2.0).ceil]] : [false, x]) if Integer === x\n  a, b = x\n  \U0001FA93, a = split[a]\n  return [true, [a, b]] if \U0001FA93\n  \U0001FA93, b = split[b]\n  [\U0001FA93, [a, b]]\n}\n\nadd = -> a, b {\n  x = [a, b]\n  loop {\n    \U0001F4A5, _, x, _ = explode[x]\n    next if \U0001F4A5\n    \U0001FA93, x = split[x]\n    return x if !\U0001FA93\n  }\n}\n\nmagnitude = -> a {\n  Integer === a ? a : 3 * magnitude[a[0]] + 2 * magnitude[a[1]]\n}\n\np magnitude[lines.inject { add[_1, _2] }]\np lines.permutation(2).map { magnitude[add[_1, _2]] }.max"

data/data/solutions/github/ZogStriP/2021/19_1.yml

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

data/data/solutions/github/ZogStriP/2021/19_2.yml

@@ -0,0 +1,46 @@
+---
+- :name: 19_beacon_scanner.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    scanners = DATA.read.split("\n\n").map { |b| b.lines[1..].map { _1.split(?,).map &:to_i } }
+
+    sub = -> a, b { [a[0]-b[0], a[1]-b[1], a[2]-b[2]] }
+
+    rotate = -> x, y, z {
+      [
+        [ x, y, z], [ y, z, x], [ z, x, y], [ z, y,-x], [ y, x,-z], [ x, z,-y],
+        [ x,-y,-z], [ y,-z,-x], [ z,-x,-y], [ z,-y, x], [ y,-x, z], [ x,-z, y],
+        [-x, y,-z], [-y, z,-x], [-z, x,-y], [-z, y, x], [-y, x, z], [-x, z, y],
+        [-x,-y, z], [-y,-z, x], [-z,-x, y], [-z,-y,-x], [-y,-x,-z], [-x,-z,-y],
+      ]
+    }
+
+    match = -> s1, s2 {
+      24.times { |r|
+        s3 = s2.map { rotate[*_1][r] }
+        s1.each { |a|
+          s3.each { |b|
+            offset = sub[b, a]
+            c = s3.map { sub[_1, offset] }
+            return [c, offset] if (s1 & c).size >= 12
+          }
+        }
+      }
+      nil
+    }
+
+    matched, *unmatched = scanners
+    locations = [[0,0,0]]
+
+    while scanner = unmatched.shift
+      if r = match[matched, scanner]
+        m, l = r
+        matched |= m
+        locations << l
+      else
+        unmatched << scanner
+      end
+    end
+
+    p matched.size
+    p locations.combination(2).map { |a, b| b.zip(a).sum { (_1 - _2).abs } }.max

data/data/solutions/github/ZogStriP/2021/20_1.yml

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

data/data/solutions/github/ZogStriP/2021/20_2.yml

@@ -0,0 +1,44 @@
+---
+- :name: 20_trench_map.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    algorithm, image = DATA.read.split("\n\n")
+
+    image = image.split("\n")
+
+    min = -1
+    ymax = image.size + 1
+    xmax = image[0].size + 1
+
+    W = xmax + 100
+
+    pixels = Hash.new(0)
+
+    image.each_with_index { |l, y|
+      l.each_char.with_index { |c, x|
+        pixels[y * W + x] = 1 if c[?#]
+      }
+    }
+
+    N = [-1,0,1].product([-1,0,1])
+
+    puts [2, 48].map {
+      _1.times { |t|
+        new = Hash.new(algorithm[0][?#] ? (t % 2) ^ 1 : 0)
+
+        (min...ymax).each { |y|
+          (min...xmax).each { |x|
+            index = N.map { |dy, dx| pixels[(y + dy) * W + x + dx] }.join.to_i(2)
+            new[y * W + x] = algorithm[index][?#] ? 1 : 0
+          }
+        }
+
+        pixels = new
+
+        min  -= 1
+        xmax += 1
+        ymax += 1
+      }
+
+      pixels.values.tally[1]
+    }

data/data/solutions/github/ZogStriP/2021/21_1.yml

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

data/data/solutions/github/ZogStriP/2021/21_2.yml

@@ -0,0 +1,44 @@
+---
+- :name: 21_dirac_dice.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    i = 1
+    p = [8, 2]
+    s = [0, 0]
+    m = (1..100).lazy.cycle.each_slice(3).map(&:sum)
+
+    p 1.step.find { |r|
+      s[i ^= 1] += p[i] = (p[i] + m.next - 1) % 10 + 1
+      break r * 3 * s[1 - i] if s[i] >= 1000
+    }
+
+    w = {}
+    d = Hash.new(0)
+
+    [1,2,3].each { |d1|
+      [1,2,3].each { |d2|
+        [1,2,3].each { |d3|
+          d[d1 + d2 + d3] += 1
+        }
+      }
+    }
+
+    wins = -> p0, p1, s0=0, s1=0 {
+      w[[p0, p1, s0, s1]] ||= begin
+        win = [0, 0]
+        d.each { |r, c|
+          p = (p0 + r - 1) % 10 + 1
+          s = s0 + p
+          if s >= 21
+            win[0] += c
+          else
+            w1, w0 = wins[p1, p, s1, s]
+            win[0] += w0 * c
+            win[1] += w1 * c
+          end
+        }
+        win
+      end
+    }
+
+    p wins[8, 2].max

data/data/solutions/github/ZogStriP/2021/22_1.yml

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

data/data/solutions/github/ZogStriP/2021/22_2.yml

@@ -0,0 +1,28 @@
+---
+- :name: 22_reactor_reboot.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    steps = DATA.map { |l| [!l[?f], *l.scan(/-?\d+/).each_slice(2).map{_1.to_i.._2.to_i}] }
+
+    size = -> a, b, c { a && b && c ? a.size * b.size * c.size : 0 }
+    ❎ = -> a, b { a.begin <= b.end && b.begin <= a.end && ([a.begin, b.begin].max..[a.end, b.end].min) }
+
+    cubes = Hash.new(0)
+
+    steps.each { |on, x, y, z|
+      changes = Hash.new(0)
+
+      cubes.each { |(xx, yy, zz), m|
+        ix = ❎[x, xx]
+        iy = ❎[y, yy]
+        iz = ❎[z, zz]
+        changes[[ix, iy, iz]] -= m if ix && iy && iz
+      }
+
+      changes[[x, y, z]] += 1 if on
+      cubes.merge!(changes) { _2 + _3 }
+      cubes.select! { _2 != 0 }
+    }
+
+    p cubes.sum { |c, m| size[*c.map{❎[_1,-50..50]}] * m }
+    p cubes.sum { |c, m| size[*c] * m }

data/data/solutions/github/ZogStriP/2021/23_1.yml

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

data/data/solutions/github/ZogStriP/2021/23_2.yml

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

data/data/solutions/github/ZogStriP/2021/24_1.yml

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

data/data/solutions/github/ZogStriP/2021/24_2.yml

@@ -0,0 +1,30 @@
+---
+- :name: 24_arithmetic_logic_unit.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    lines = DATA.read.split("\n")
+    pairs = 14.times.map { |i| [lines[i * 18 + 5][6..].to_i, lines[i * 18 + 15][6..].to_i] }
+    stack = []
+    links = {}
+
+    pairs.each_with_index { |(a, b), i|
+      if a > 0
+        stack << [i, b]
+      else
+        j, bb = stack.pop
+        links[i] = [j, a + bb]
+      end
+    }
+
+    max = {}
+    min = {}
+
+    links.each { |i, (j, delta)|
+      max[i] = [9, 9 + delta].min
+      max[j] = [9, 9 - delta].min
+      min[i] = [1, 1 + delta].max
+      min[j] = [1, 1 - delta].max
+    }
+
+    puts 14.times.map { max[_1] } * ""
+    puts 14.times.map { min[_1] } * ""

data/data/solutions/github/ZogStriP/2021/25_1.yml

@@ -0,0 +1,45 @@
+---
+- :name: 25_sea_cucumber.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    require "set"
+
+    SEAFLOOR = DATA.read.split("\n")
+
+    H = SEAFLOOR.size
+    W = SEAFLOOR[0].size
+
+    east  = Set.new
+    south = Set.new
+
+    SEAFLOOR.each.with_index { |l, y|
+      l.each_char.with_index { |c, x|
+        east  << y * W + x if c[?>]
+        south << y * W + x if c[?v]
+      }
+    }
+
+    p 1.step { |step|
+      e = Set.new
+      all = east | south
+
+      east.each { |n|
+        y, x = n.divmod(W)
+        p = y * W + (x + 1) % W
+        e << (all.include?(p) ? n : p)
+      }
+
+      s = Set.new
+      all = e | south
+
+      south.each { |n|
+        y, x = n.divmod(W)
+        p = ((y + 1) % H) * W + x
+        s << (all.include?(p) ? n : p)
+      }
+
+      break step if e == east && s == south
+
+      east = e
+      south = s
+    }

data/data/solutions/github/ZogStriP/2022/01_1.yml

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

data/data/solutions/github/ZogStriP/2022/01_2.yml

@@ -0,0 +1,7 @@
+---
+- :name: 01_calorie_counting.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    calories = DATA.read.split("\n\n").map { _1.lines.sum &:to_i }.max 3
+
+    p calories[0], calories.sum

data/data/solutions/github/ZogStriP/2022/02_1.yml

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

data/data/solutions/github/ZogStriP/2022/02_2.yml

@@ -0,0 +1,17 @@
+---
+- :name: 02_rock_paper_scissors.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    SCORES = {
+      "A X" => [1 + 3, 3 + 0],
+      "A Y" => [2 + 6, 1 + 3],
+      "A Z" => [3 + 0, 2 + 6],
+      "B X" => [1 + 0, 1 + 0],
+      "B Y" => [2 + 3, 2 + 3],
+      "B Z" => [3 + 6, 3 + 6],
+      "C X" => [1 + 6, 2 + 0],
+      "C Y" => [2 + 0, 3 + 3],
+      "C Z" => [3 + 3, 1 + 6],
+    }
+
+    puts DATA.map { SCORES[_1.strip] }.transpose.map &:sum

data/data/solutions/github/ZogStriP/2022/03_1.yml

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

data/data/solutions/github/ZogStriP/2022/03_2.yml

@@ -0,0 +1,12 @@
+---
+- :name: 03_rucksack_reorganization.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    PRIORITIES = [*?a..?z, *?A..?Z].each.with_index(1).to_h
+
+    sacks = DATA.map { _1.chomp.chars }
+
+    priority = -> (*sacks) { PRIORITIES[sacks.reduce(:&)[0]] }
+
+    p sacks.sum { priority[*_1.each_slice(_1.size / 2)] }
+    p sacks.each_slice(3).sum { priority[*_1] }

data/data/solutions/github/ZogStriP/2022/04_1.yml

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

data/data/solutions/github/ZogStriP/2022/04_2.yml

@@ -0,0 +1,8 @@
+---
+- :name: 04_camp_cleanup.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    pairs = DATA.map { |l| l.split(?,).map { eval _1.sub(?-, "..") } }
+
+    p pairs.count { _1.cover?(_2) || _2.cover?(_1) }
+    p pairs.count { (_1.to_a & _2.to_a).any? }

data/data/solutions/github/ZogStriP/2022/05_1.yml

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

data/data/solutions/github/ZogStriP/2022/05_2.yml

@@ -0,0 +1,17 @@
+---
+- :name: 05_supply_stacks.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    crates, moves = DATA.read.split("\n\n").map &:lines
+
+    moves.map! { _1.scan(/\d+/).map &:to_i }
+
+    init = crates[..-2].map { |line|
+      line.ljust(crates[-2].size, " ").chars.each_slice(4).map { _1[1][/\w/] }
+    }.transpose.map &:compact
+
+    puts %i{reverse itself}.map { |t|
+      stacks = init.map &:dup
+      moves.each { |n, from, to| stacks[to - 1].unshift *stacks[from - 1].shift(n).send(t) }
+      stacks.map(&:first).join
+    }

data/data/solutions/github/ZogStriP/2022/06_1.yml

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

data/data/solutions/github/ZogStriP/2022/06_2.yml

@@ -0,0 +1,7 @@
+---
+- :name: 06_tuning_trouble.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    message = DATA.read.chars
+
+    puts [4, 14].map { |s| s + message.each_cons(s).find_index { _1.uniq == _1 } }

data/data/solutions/github/ZogStriP/2022/07_1.yml

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

data/data/solutions/github/ZogStriP/2022/07_2.yml

@@ -0,0 +1,16 @@
+---
+- :name: 07_no_space_left_on_device.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    sizes = Hash.new(0)
+
+    DATA.each_with_object([]) { |line, stack|
+      case line.split
+      in ["$", "cd", ".."]; stack.pop
+      in ["$", "cd", dir]; stack << [stack[-1], dir].compact * " "
+      in [size, _]; stack.each { sizes[_1] += size.to_i }
+      end
+    }
+
+    p sizes.values.select { _1 < 100_000 }.sum
+    p sizes.values.select { _1 >= sizes["/"] - 40_000_000 }.min

data/data/solutions/github/ZogStriP/2022/08_1.yml

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

data/data/solutions/github/ZogStriP/2022/08_2.yml

@@ -0,0 +1,26 @@
+---
+- :name: '08_treetop_tree_house.rb'
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    trees = DATA.map { _1.chop.chars }
+
+    height = trees.size
+    width = trees[0].size
+
+    p height.times.sum { |y|
+      width.times.count { |x|
+        (x-1).downto(0).all? { trees[y][_1] < trees[y][x] } ||
+        (x+1...width).all? { trees[y][_1] < trees[y][x] } ||
+        (y-1).downto(0).all? { trees[_1][x] < trees[y][x] } ||
+        (y+1...height).all? { trees[_1][x] < trees[y][x] }
+      }
+    }
+
+    p height.times.map { |y|
+      width.times.map { |x|
+        ((x-1).downto(0).find_index { trees[y][_1] >= trees[y][x] }&.succ || x) *
+        ((x+1...width).find_index { trees[y][_1] >= trees[y][x] }&.succ || (width - x - 1)) *
+        ((y-1).downto(0).find_index { trees[_1][x] >= trees[y][x] }&.succ || y) *
+        ((y+1...height).find_index { trees[_1][x] >= trees[y][x] }&.succ || (height - y - 1))
+      }.max
+    }.max

data/data/solutions/github/ZogStriP/2022/09_1.yml

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

data/data/solutions/github/ZogStriP/2022/09_2.yml

@@ -0,0 +1,31 @@
+---
+- :name: '09_rope_bridge.rb'
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    y = x = 0
+
+    pos = DATA.flat_map { |line|
+      d, l = line.split
+      l.to_i.times.map {
+        d[?U] && y -= 1
+        d[?D] && y += 1
+        d[?L] && x -= 1
+        d[?R] && x += 1
+        [y, x]
+      }
+    }
+
+    visited = 9.times.map {
+      y = x = 0
+      pos = pos.filter_map { |yy, xx|
+        dy = yy - y
+        dx = xx - x
+        next if dy.abs <= 1 && dx.abs <= 1
+        y += dy.abs == 1 ? dy : dy / 2
+        x += dx.abs == 1 ? dx : dx / 2
+        [y, x]
+      }
+      (pos | [[0, 0]]).uniq.size
+    }
+
+    p visited[0], visited[-1]

data/data/solutions/github/ZogStriP/2022/10_1.yml

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

data/data/solutions/github/ZogStriP/2022/10_2.yml

@@ -0,0 +1,20 @@
+---
+- :name: 10_cathode-ray_tube.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    x = 1
+
+    signals = [1] + DATA.flat_map { |line|
+      case line.split
+      in ["noop"]; [x]
+      in ["addx", v]; [x, x += v.to_i]
+      end
+    }
+
+    p 20.step(220, 40).sum { _1 * signals[_1 - 1] }
+
+    signals.each_slice(40) { |row|
+      puts row.map.with_index { |signal, x|
+        (signal - x).abs <= 1 ? "#" : " "
+      }.join
+    }

data/data/solutions/github/ZogStriP/2022/11_1.yml

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

data/data/solutions/github/ZogStriP/2022/11_2.yml

@@ -0,0 +1,38 @@
+---
+- :name: 11_monkey_in_the_middle.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2022
+  :solution: |-
+    monkeys = []
+    operations = []
+    throws = []
+    inspections = []
+
+    n = 1
+
+    DATA.read.split("\n\n").each { |monkey|
+      _, s, o, t, a, b = monkey.lines
+      t = t[/(\d+)/, 1].to_i
+      a = a[/(\d+)/, 1].to_i
+      b = b[/(\d+)/, 1].to_i
+      n *= t
+      monkeys << s.scan(/\d+/).map(&:to_i)
+      operations << eval("-> (old) { #{o[o.index(?=) + 1..]} }")
+      throws << -> (n) { n % t == 0 ? a : b }
+      inspections << 0
+    }
+
+    round = -> (&worry) {
+      monkeys.size.times.each { |m|
+        while item = monkeys[m].shift
+          w = worry.call operations[m][item]
+          monkeys[throws[m][w]] << w
+          inspections[m] += 1
+        end
+      }
+    }
+
+    #20.times { round[] { _1 / 3 } }
+    #p inspections.max(2).reduce :*
+
+    10000.times { round[] { _1 % n } }
+    p inspections.max(2).reduce :*

data/data/solutions/github/ZogStriP/2022/12_1.yml

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