Skip to content

Releases: amclin/advent-of-code

v1.6.1

06 Jun 01:07
Compare
Choose a tag to compare

1.6.1 (2019-06-06)

Bug Fixes

  • deps: update semantic-release dev dependencies (086bb17)

v1.6.0

23 Dec 18:26
9cdc695
Compare
Choose a tag to compare

1.6.0 (2018-12-23)

Bug Fixes

  • 2018 day-14: catch patterns that occur at search buffer breaks (dfa4234)

Features

  • 2018 day-14: eliminate the need to define elves when creating recipes (05b7a9b)
  • 2018 day-14: eliminate the need to define elves when creating recipes (bf28b80)
  • 2018 day-14: find the position of a specified pattern (cb1a6d8)
  • 2018 day-14: simplify initialization steps for recipes and elves (b008964)

v1.5.0

23 Dec 01:54
c6dd678
Compare
Choose a tag to compare

1.5.0 (2018-12-23)

Features

  • 2013 day-14: solution to part 1, calculate X recipes after Y recipes (59f02c9)
  • 2018 day-13: recipe list and iterators of elves (513eac0)

v1.4.1

22 Dec 22:24
Compare
Choose a tag to compare

1.4.1 (2018-12-22)

Bug Fixes

  • 2018 day-12: off by one, need generation 5,000,000,000, not generation 4,999,999,999 (1c46a1f)

v1.4.0

22 Dec 22:16
a3bda60
Compare
Choose a tag to compare

1.4.0 (2018-12-22)

Features

  • 2018 day-12: find checksum at generation 50,000,000,000 (9150f94)

v1.3.0

22 Dec 22:12
9c5fd5d
Compare
Choose a tag to compare

1.3.0 (2018-12-22)

Bug Fixes

  • 2018 day-02: account for variable padding needed around list of plants between generations (51c3b30)
  • 2018 day-12: 0th generation needs padding to match the rules requriements (bc721de)
  • 2018 day-12: correct input (3f3d57f)

Features

  • 2018 day-12: generate checksums for a generation (9eef11d)
  • 2018 day-12: generate plants from input and pattern rules (2706538)
  • 2018 day-12: initialize plant states (6cbd22d)
  • 2018 day-12: plant generation rules parser (9e63219)

v1.2.0

22 Dec 00:42
c151fa5
Compare
Choose a tag to compare

1.2.0 (2018-12-22)

Bug Fixes

  • 2018 day-13: array offset errors when multiple collisions in a single frame (02311a9)

Features

  • 2018 day-13: solution for day 13 part 2 (578645a)

v1.1.0

21 Dec 22:43
37bda76
Compare
Choose a tag to compare

1.1.0 (2018-12-21)

Bug Fixes

  • 2018 day-13: correct order for intersections is left, straight, right, repeat (9b9f3cf)

Features

  • 2018 day-13: advance all carts each turn and correctly handle intersection rotation logic (5b2e83f)
  • 2018 day-13: draw cart collisions on display (dbec37c)
  • 2018 day-13: individual cart movement (d9d8489)
  • 2018 day-13: parse, store, and display track with carts (e9e45dc)
  • 2018 day-13: part 1 solution (375135b)

v1.0.0

20 Dec 03:46
Compare
Choose a tag to compare

1.0.0 (2018-12-20)

Bug Fixes

  • 2018 day-10: correct calculations for determining displayable content area (28d6cff)

Features

  • 2018 day-01: part-1 support line-separated list in addition to comma-separated (76e238c)
  • 2018 day-01: part-2 finds first match in frequency adjustment sequence (1d97356)
  • 2018 day-01: passing day 1 part 1 tests (9f1d8f1)
  • 2018 day-02: adds mechanism to score the difference between 2 ids (ebb95df)
  • 2018 day-02: generate checksums (8d8f737)
  • 2018 day-02: identify the common letters shared between two box IDs (92511ad)
  • 2018 day-02: search a list to find similar items (7e4890a)
  • 2018 day-02: solution for day2 part 2 (cece8b7)
  • 2018 day-03: ability to store conflicts in a stateful log (c5207fb)
  • 2018 day-03: identify non-overlapping claim (bb67ea4)
  • 2018 day-03: parses claim strings into claim objects (840d76b)
  • 2018 day-03: rewrite to use iterators over nested array storage (dfffb43)
  • 2018 day-03: track claims that have been made (9a3b562)
  • 2018 day-03: track claims to pieces of cloth (3b78527)
  • 2018 day-04: ability to sort arrays of objects based on values of multiple keys (4234dfb)
  • 2018 day-04: add a stateful data store (28fd721)
  • 2018 day-04: find the sleepiest minute of the most regularly asleep guard (e5679e6)
  • 2018 day-04: find time that guard is most often asleep (3f090c1)
  • 2018 day-04: generate bitmap strings based on guard activities (0b3ed0b)
  • 2018 day-04: guard's sleepiest minute (a7b34e5)
  • 2018 day-04: guard's sleepiest minute (6bc91b2)
  • 2018 day-04: parse log files to get guard activities (4fc18f7)
  • 2018 day-04: parser for guard sleep log lines (b984624)
  • 2018 day-04: reusable dynamic sort filter for sorting arrays of objects based on specified keys (c813abe)
  • 2018 day-04: sort guards activities by timestamp (b7666c2)
  • 2018 day-04: stack-rank the guards by laziness (1da18c4)
  • 2018 day-05: finds length of shortest polymer assuming one letter pair is invalid (5af5dc5)
  • 2018 day-05: reduce case-opposite pairs from a string (02a9c1e)
  • 2018 day-06: calculate areas around points (9052afb)
  • 2018 day-06: calculate manhattan distances (8f53478)
  • 2018 day-06: calculate safe area (0527ef8)
  • 2018 day-07: answer for part 1 (d370f9e)
  • 2018 day-07: build dependency tree from rules (ad32c3c)
  • 2018 day-07: calculate the time to run the tasks with a given number of workers (3c26674)
  • 2018 day-07: generate sorted list of instructions (da116c4)
  • 2018 day-07: parse log file to structured data (098e385)
  • 2018 day-08: parse input to usable data (0fe7ed7)
  • 2018 day-08: tally the values for part 2 (7aded4b)
  • 2018 day-08: total metadata (f3d57c1)
  • 2018 day-09: play the marble game for high score (1982738)
  • 2018 day-10: automatically calculate the display area (7f05db2)
  • 2018 day-10: Automatically guess the best frame based on focus (f519b0b)
  • 2018 day-10: calculate rack power levels (7ec8413)
  • 2018 day-10: parse input to structured data (87fc7d2)
  • 2018 day-10: part 2 was already solved (34f6661)
  • 2018 day-10: render animation frame to a buffer (8808db6)
  • 2018 day-10: track the beacons and animate them across frames (11e880e)
  • 2018 day-11: adds a way to find the max powered square without first generating cached tallies for every point (d6e652c)
  • 2018 day-11: Compare across any size squares (427a5a9)
  • 2018 day-11: Finds the square with the most power (1dc7b24)
  • 2018 day-11: hackish solution identified by noticing a pattern in the logs and forcing an arbitrary negative condition (585cbbe)
  • 2018 day-11: total the power for each 3x3 grid (ea468f5)