29:null 2a:["$","title",null,{"children":"AoC 2022 Day 9: Rope Bridge | Cameron DeCoster | Observable"}] 2f:Tfae,## Part One This rope bridge creaks as you walk along it. You aren't sure how old it is, or whether it can even support your weight. It seems to support the Elves just fine, though. The bridge spans a gorge which was carved out by the massive river far below you. You step carefully; as you do, the ropes stretch and twist. You decide to distract yourself by modeling rope physics; maybe you can even figure out where not to step. Consider a rope with a knot at each end; these knots mark the head and the tail of the rope. If the head moves far enough away from the tail, the tail is pulled toward the head. Due to nebulous reasoning involving [Planck lengths](https://en.wikipedia.org/wiki/Planck_units#Planck_length), you should be able to model the positions of the knots on a two-dimensional grid. Then, by following a hypothetical series of motions (your puzzle input) for the head, you can determine how the tail will move. Due to the aforementioned Planck lengths, the rope must be quite short; in fact, the head (`H`) and tail (`T`) must always be touching (diagonally adjacent and even overlapping both count as touching): ``` .... .TH. .... .... .H.. ..T. .... ... .H. (H covers T) ... ``` If the head is ever two steps directly up, down, left, or right from the tail, the tail must also move one step in that direction so it remains close enough: ..... ..... ..... .TH.. -> .T.H. -> ..TH. ..... ..... ..... ... ... ... .T. .T. ... .H. -> ... -> .T. ... .H. .H. ... ... ... Otherwise, if the head and tail aren't touching and aren't in the same row or column, the tail always moves one step diagonally to keep up: ``` ..... ..... ..... ..... ..H.. ..H.. ..H.. -> ..... -> ..T.. .T... .T... ..... ..... ..... ..... ..... ..... ..... ..... ..... ..... ..H.. -> ...H. -> ..TH. .T... .T... ..... ..... ..... ..... ``` You just need to work out where the tail goes as the head follows a series of motions. Assume the head and the tail both start at the same position, overlapping. For example: ``` R 4 U 4 L 3 D 1 R 4 D 1 L 5 R 2 ``` This series of motions moves the head right four steps, then up four steps, then left three steps, then down one step, and so on. After each step, you'll need to update the position of the tail if the step means the head is no longer adjacent to the tail. Visually, these motions occur as follows (`s` marks the starting position as a reference point): ``` == Initial State == ...... ...... ...... ...... H..... (H covers T, s) == R 4 == ...... ...... ...... ...... TH.... (T covers s) ...... ...... ...... ...... sTH... ...... ...... ...... ...... s.TH.. ...... ...... ...... ...... s..TH. == U 4 == ...... ...... ...... ....H. s..T.. ...... ...... ....H. ....T. s..... ...... ....H. ....T. ...... s..... ....H. ....T. ...... ...... s..... == L 3 == ...H.. ....T. ...... ...... s..... ..HT.. ...... ...... ...... s..... .HT... ...... ...... ...... s..... == D 1 == ..T... .H.... ...... ...... s..... == R 4 == ..T... ..H... ...... ...... s..... ..T... ...H.. ...... ...... s..... ...... ...TH. ...... ...... s..... ...... ....TH ...... ...... s..... == D 1 == ...... ....T. .....H ...... s..... == L 5 == ...... ....T. ....H. ...... s..... ...... ....T. ...H.. ...... s..... ...... ...... ..HT.. ...... s..... ...... ...... .HT... ...... s..... ...... ...... HT.... ...... s..... == R 2 == ...... ...... .H.... (H covers T) ...... s..... ...... ...... .TH... ...... s..... ``` After simulating the rope, you can count up all of the positions the tail visited at least once. In this diagram, `s` again marks the starting position (which the tail also visited) and `#` marks other positions the tail visited: ``` ..##.. ...##. .####. ....#. s###.. ``` So, there are `13` positions the tail visited at least once. Simulate your complete hypothetical series of motions. How many positions does the tail of the rope visit at least once?30:Tb1b,headTailPositions = { const h = {grid: [["s"]], x: 0, y: 0}; const t = {grid: [["s"]], x: 0, y: 0}; function tailShouldMove(key) { return (Math.abs(h[key] - t[key])) > 1; } for (const [direction, step] of motions.slice(0, index)) { // for (const [direction, step] of motions) { switch (direction) { case "U": for (let i = 0; i < step; i++) { // Add row that doesn't exist if (h.y + 1 > h.grid.length - 1) { h.grid.push(new Array(h.grid[0].length)); t.grid.push(new Array(h.grid[0].length)); } h.grid[h.y][h.x] = 1; h.y += 1; h.grid[h.y][h.x] = 8; // Check how new h.y will affect t if (tailShouldMove("y")) { t.grid[t.y][t.x] = 1; t.x = h.x; t.y = h.y - 1; t.grid[t.y][t.x] = 8; } } break; case "D": for (let i = 0; i < step; i++) { // Add row that doesn't exist. Adjust coords accordingly. if (h.y - 1 < 0) { h.grid.unshift(new Array(h.grid[0].length)); h.y++; t.grid.unshift(new Array(h.grid[0].length)); t.y++; } h.grid[h.y][h.x] = 1; h.y -= 1; h.grid[h.y][h.x] = 8; // Check how new h.y will affect t if (tailShouldMove("y")) { t.grid[t.y][t.x] = 1; t.x = h.x; t.y = h.y + 1; t.grid[t.y][t.x] = 8; } } break; case "L": for (let i = 0; i < step; i++) { // Add cell that doesn't exist. Adjust coords accordingly. if (h.x - 1 < 0) { h.grid.map(row => row.unshift(undefined)); h.x++; t.grid.map(row => row.unshift(undefined)); t.x++; } h.grid[h.y][h.x] = 1; h.x -= 1; h.grid[h.y][h.x] = 8; // Check how new h.x will affect t if (tailShouldMove("x")) { t.grid[t.y][t.x] = 1; t.x = h.x + 1; t.y = h.y; t.grid[t.y][t.x] = 8; } } break; case "R": for (let i = 0; i < step; i++) { // Add cell that doesn't exist if (h.x + 1 > h.grid[h.y].length - 1) { h.grid.map(row => row.push(undefined)); t.grid.map(row => row.push(undefined)); } h.grid[h.y][h.x] = 1; h.x += 1; h.grid[h.y][h.x] = 8; // Check how new h.x will affect t if (tailShouldMove("x")) { t.grid[t.y][t.x] = 1; t.x = h.x - 1; t.y = h.y; t.grid[t.y][t.x] = 8; } } break; } } return t.grid .map(row => Array.from(row, v => v || 0)); }31:T23a0,## Part Two A rope snaps! Suddenly, the river is getting a lot closer than you remember. The bridge is still there, but some of the ropes that broke are now whipping toward you as you fall through the air! The ropes are moving too quickly to grab; you only have a few seconds to choose how to arch your body to avoid being hit. Fortunately, your simulation can be extended to support longer ropes. Rather than two knots, you now must simulate a rope consisting of ten knots. One knot is still the head of the rope and moves according to the series of motions. Each knot further down the rope follows the knot in front of it using the same rules as before. Using the same series of motions as the above example, but with the knots marked `H`, `1`, `2`, ..., `9`, the motions now occur as follows: ``` == Initial State == ...... ...... ...... ...... H..... (H covers 1, 2, 3, 4, 5, 6, 7, 8, 9, s) == R 4 == ...... ...... ...... ...... 1H.... (1 covers 2, 3, 4, 5, 6, 7, 8, 9, s) ...... ...... ...... ...... 21H... (2 covers 3, 4, 5, 6, 7, 8, 9, s) ...... ...... ...... ...... 321H.. (3 covers 4, 5, 6, 7, 8, 9, s) ...... ...... ...... ...... 4321H. (4 covers 5, 6, 7, 8, 9, s) == U 4 == ...... ...... ...... ....H. 4321.. (4 covers 5, 6, 7, 8, 9, s) ...... ...... ....H. .4321. 5..... (5 covers 6, 7, 8, 9, s) ...... ....H. ....1. .432.. 5..... (5 covers 6, 7, 8, 9, s) ....H. ....1. ..432. .5.... 6..... (6 covers 7, 8, 9, s) == L 3 == ...H.. ....1. ..432. .5.... 6..... (6 covers 7, 8, 9, s) ..H1.. ...2.. ..43.. .5.... 6..... (6 covers 7, 8, 9, s) .H1... ...2.. ..43.. .5.... 6..... (6 covers 7, 8, 9, s) == D 1 == ..1... .H.2.. ..43.. .5.... 6..... (6 covers 7, 8, 9, s) == R 4 == ..1... ..H2.. ..43.. .5.... 6..... (6 covers 7, 8, 9, s) ..1... ...H.. (H covers 2) ..43.. .5.... 6..... (6 covers 7, 8, 9, s) ...... ...1H. (1 covers 2) ..43.. .5.... 6..... (6 covers 7, 8, 9, s) ...... ...21H ..43.. .5.... 6..... (6 covers 7, 8, 9, s) == D 1 == ...... ...21. ..43.H .5.... 6..... (6 covers 7, 8, 9, s) == L 5 == ...... ...21. ..43H. .5.... 6..... (6 covers 7, 8, 9, s) ...... ...21. ..4H.. (H covers 3) .5.... 6..... (6 covers 7, 8, 9, s) ...... ...2.. ..H1.. (H covers 4; 1 covers 3) .5.... 6..... (6 covers 7, 8, 9, s) ...... ...2.. .H13.. (1 covers 4) .5.... 6..... (6 covers 7, 8, 9, s) ...... ...... H123.. (2 covers 4) .5.... 6..... (6 covers 7, 8, 9, s) == R 2 == ...... ...... .H23.. (H covers 1; 2 covers 4) .5.... 6..... (6 covers 7, 8, 9, s) ...... ...... .1H3.. (H covers 2, 4) .5.... 6..... (6 covers 7, 8, 9, s) ``` Now, you need to keep track of the positions the new tail, `9`, visits. In this example, the tail never moves, and so it only visits 1 position. However, be careful: more types of motion are possible than before, so you might want to visually compare your simulated rope to the one above. Here's a larger example: ``` R 5 U 8 L 8 D 3 R 17 D 10 L 25 U 20 ``` These motions occur as follows (individual steps are not shown): ``` == Initial State == .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... ...........H.............. (H covers 1, 2, 3, 4, 5, 6, 7, 8, 9, s) .......................... .......................... .......................... .......................... .......................... == R 5 == .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... ...........54321H......... (5 covers 6, 7, 8, 9, s) .......................... .......................... .......................... .......................... .......................... == U 8 == .......................... .......................... .......................... .......................... .......................... .......................... .......................... ................H......... ................1......... ................2......... ................3......... ...............54......... ..............6........... .............7............ ............8............. ...........9.............. (9 covers s) .......................... .......................... .......................... .......................... .......................... == L 8 == .......................... .......................... .......................... .......................... .......................... .......................... .......................... ........H1234............. ............5............. ............6............. ............7............. ............8............. ............9............. .......................... .......................... ...........s.............. .......................... .......................... .......................... .......................... .......................... == D 3 == .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .........2345............. ........1...6............. ........H...7............. ............8............. ............9............. .......................... .......................... ...........s.............. .......................... .......................... .......................... .......................... .......................... == R 17 == .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... ................987654321H .......................... .......................... .......................... .......................... ...........s.............. .......................... .......................... .......................... .......................... .......................... == D 10 == .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... ...........s.........98765 .........................4 .........................3 .........................2 .........................1 .........................H == L 25 == .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... ...........s.............. .......................... .......................... .......................... .......................... H123456789................ == U 20 == H......................... 1......................... 2......................... 3......................... 4......................... 5......................... 6......................... 7......................... 8......................... 9......................... .......................... .......................... .......................... .......................... .......................... ...........s.............. .......................... .......................... .......................... .......................... .......................... Now, the tail (9) visits 36 positions (including s) at least once: .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... .......................... #......................... #.............###......... #............#...#........ .#..........#.....#....... ..#..........#.....#...... ...#........#.......#..... ....#......s.........#.... .....#..............#..... ......#............#...... .......#..........#....... ........#........#........ .........########......... ``` Simulate your complete series of motions on a larger rope with ten knots. How many positions does the tail of the rope visit at least once?32:T15fc,function calcTailPosition(numKnots = 2) { const knots = []; for (let i = 0; i < numKnots; i++) { knots.push({grid: [["s"]], x: 0, y: 0}); } function updateTailPosition(h, t) { // A tailing knot always needs to get behind the head if possible, except when it moves diagonally to be diagonal to the head const dX = h.x - t.x; const dY = h.y - t.y; if (dX > 1 && dY > 1) { // Move tail right and up t.grid[t.y][t.x] = 1; t.x = h.x - 1; t.y = h.y - 1; t.grid[t.y][t.x] = 8; } else if (dX > 1 && dY < -1) { // Move tail right and down t.grid[t.y][t.x] = 1; t.x = h.x - 1; t.y = h.y + 1; t.grid[t.y][t.x] = 8; } else if (dX < -1 && dY > 1) { // Move tail left and up?? t.grid[t.y][t.x] = 1; t.x = h.x + 1; t.y = h.y - 1; t.grid[t.y][t.x] = 8; } else if (dX < -1 && dY < -1) { // Move tail right and down?? t.grid[t.y][t.x] = 1; t.x = h.x + 1; t.y = h.y + 1; t.grid[t.y][t.x] = 8; } else if (dX > 1 && Math.abs(dY) > 0) { // Move tail right and vertically t.grid[t.y][t.x] = 1; t.x = h.x - 1; t.y = h.y; t.grid[t.y][t.x] = 8; } else if (dX < -1 && Math.abs(dY) > 0) { // Move tail left and vertically t.grid[t.y][t.x] = 1; t.x = h.x + 1; t.y = h.y; t.grid[t.y][t.x] = 8; } else if (dY > 1 && Math.abs(dX) > 0) { // Move tail up and horizontally t.grid[t.y][t.x] = 1; t.x = h.x; t.y = h.y - 1; t.grid[t.y][t.x] = 8; } else if (dY < -1 && Math.abs(dX) > 0) { // Move tail down t.grid[t.y][t.x] = 1; t.x = h.x; t.y = h.y + 1; t.grid[t.y][t.x] = 8; } else if (dY > 1 && dX === 0) { // Move tail up t.grid[t.y][t.x] = 1; // t.x = h.x; t.y = h.y - 1; t.grid[t.y][t.x] = 8; } else if (dY < -1 && dX === 0) { // Move tail down t.grid[t.y][t.x] = 1; // t.x = h.x; t.y = h.y + 1; t.grid[t.y][t.x] = 8; } else if (dX > 1 && dY === 0) { // Move tail right t.grid[t.y][t.x] = 1; t.x = h.x - 1; // t.y = h.y; t.grid[t.y][t.x] = 8; } else if (dX < -1 && dY === 0) { // Move tail left t.grid[t.y][t.x] = 1; t.x = h.x + 1; // t.y = h.y; t.grid[t.y][t.x] = 8; } } // for (const [dirIndex, [direction, step]] of testMotions2.slice(0, index).entries()) { for (const [direction, step] of motions) { switch (direction) { case "U": for (let i = 0; i < step; i++) { for (let j = 0; j < knots.length - 1; j++) { const h = knots[j]; const t = knots[j + 1]; if (j === 0) { // Add row that doesn't exist if (h.y + 1 > h.grid.length - 1) { knots.forEach(k => k.grid.push(new Array(knots[0].grid[0].length))); } h.grid[h.y][h.x] = 1; h.y += 1; h.grid[h.y][h.x] = 8; } // Check how new h.y will affect t updateTailPosition(h, t); } } break; case "D": for (let i = 0; i < step; i++) { for (let j = 0; j < knots.length - 1; j++) { const h = knots[j]; const t = knots[j + 1]; // Add row that doesn't exist. Adjust coords accordingly. if (j === 0) { if (h.y - 1 < 0) { knots.forEach(k => { k.grid.unshift(new Array(knots[0].grid[0].length)) k.y++; }); } h.grid[h.y][h.x] = 1; h.y -= 1; h.grid[h.y][h.x] = 8; } // Check how new h.y will affect t updateTailPosition(h, t); } } break; case "L": for (let i = 0; i < step; i++) { for (let j = 0; j < knots.length - 1; j++) { const h = knots[j]; const t = knots[j + 1]; // Add cell that doesn't exist. Adjust coords accordingly. if (j === 0) { if (h.x - 1 < 0) { knots.forEach(k => { k.grid.forEach(row => row.unshift(undefined)) k.x++; }); } h.grid[h.y][h.x] = 1; h.x -= 1; h.grid[h.y][h.x] = 8; } // Check how new h.x will affect t updateTailPosition(h, t); } } break; case "R": for (let i = 0; i < step; i++) { for (let j = 0; j < knots.length - 1; j++) { const h = knots[j]; const t = knots[j + 1]; // Add cell that doesn't exist if (j === 0) { if (h.x + 1 > h.grid[h.y].length - 1) { knots.forEach(k => { k.grid.forEach(row => row.push(undefined)) }); } h.grid[h.y][h.x] = 1; h.x += 1; h.grid[h.y][h.x] = 8; } // Check how new h.x will affect t updateTailPosition(h, t); } } break; } } const knotsDisplay = []; for (let i = 0; i < knots[0].grid.length; i++) { knotsDisplay.push(new Array(knots[0].grid[0].length)); } knots.forEach((k, index) => { knotsDisplay[k.y][k.x] = index + 1; }); return knots.at(-1).grid.map(row => Array.from(row, v => v || 0)); // return knotsDisplay.map(row => Array.from(row, v => v || 0)); }33:[{"id":"d130998e3524b12312149244c263010561a5aa199fc18eef26466289a8d854c5dd3519164d5fbf676765ab0845e7964d0962be681fafed458a3ab45fca5c54ca","href":"https://static.observableusercontent.com/files/d130998e3524b12312149244c263010561a5aa199fc18eef26466289a8d854c5dd3519164d5fbf676765ab0845e7964d0962be681fafed458a3ab45fca5c54ca","name":"input.txt","type":"text/plain","lastModified":1670587517758.417,"size":8427}] 2d:{"id":"d0c9613e0208e046","slug":null,"title":"AoC 2022 Day 9: Rope Bridge","thumbnail":"8ca85eb6762766069cca536d02b574c5198a120f996abf47dac185685ebd54dc","access_level":"public","create_time":"$D2022-12-09T11:47:30.093Z","update_time":"$D2022-12-28T23:24:51.332Z","view_time":null,"first_public_time":"$D2022-12-09T11:47:30.093Z","fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"f6ab620588d1fed0","login":"camdecoster","name":"Cameron DeCoster","avatar_url":"https://avatars-next.observableusercontent.com/63bf40965b2306268a0a220d959c35f633e206124542ac31f17d36ccf0d106a8","tier":"starter_2024"},"version":383,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"796aebc984a74ed9","login":"camdecoster","name":"Cameron DeCoster","avatar_url":"https://avatars-next.observableusercontent.com/63bf40965b2306268a0a220d959c35f633e206124542ac31f17d36ccf0d106a8","tier":null}],"members":[{"type":"individual","id":"796aebc984a74ed9","login":"camdecoster","name":"Cameron DeCoster","avatar_url":"https://avatars-next.observableusercontent.com/63bf40965b2306268a0a220d959c35f633e206124542ac31f17d36ccf0d106a8","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"subscribed":null,"forks":0,"collection":{"id":"9bd497335a8cc9a6","slug":"advent-of-code-2022","title":"Advent of Code 2022","owner":{"id":"f6ab620588d1fed0","login":"camdecoster","name":"Cameron DeCoster"}},"type":"notebook","body":{"title":"AoC 2022 Day 9: Rope Bridge","cells":[{"id":0,"value":"# [AoC 2022 Day 9: Rope Bridge](https://adventofcode.com/2022/day/9)","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined"},{"id":7,"value":"$2f","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined"},{"id":11,"value":"testInput = `R 4\nU 4\nL 3\nD 1\nR 4\nD 1\nL 5\nR 2`;","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":25,"value":"input = FileAttachment(\"input.txt\").text()","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":12,"value":"function getMotions(motionString) {\n return motionString\n .trim()\n .split(\"\\n\")\n .map(row => row\n .split(\" \")\n )\n .map(row => [row[0], Number(row[1])]);\n};","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":62,"value":"motions = getMotions(input);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":274,"value":"testMotions = getMotions(testInput);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":38,"value":"- How do I track the positions? Array of unknown size?\n- Track the relative positions of the H, T\n- For any given move by the H, check distance to T, then move T if necessary\n- Initially, just follow the head positions","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined"},{"id":41,"value":"$30","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":172,"value":"headTailPositions.reduce((total, row) => total + row.reduce((rowTotal, v) => rowTotal + (v ? 1 : 0)), 0);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":207,"value":"$31","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined"},{"id":320,"value":"testInput2 = `R 5\nU 8\nL 8\nD 3\nR 17\nD 10\nL 25\nU 20`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":323,"value":"testMotions2 = getMotions(testInput2);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":144,"value":"viewof index= Inputs.range([0, testMotions2.length], {label: \"Motion step\", step: 1, value: 0})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":153,"value":"`Last command: ${testMotions2[index - 1]?.join(\"\")} | Next command: ${testMotions2[index]?.join(\"\")}`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":214,"value":"calcTailPosition(10)\n .reduce((total, row, i) => total + row.reduce((rowTotal, v, i) => rowTotal + (v > 0 ? 1 : 0), 0), 0);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"},{"id":211,"value":"$32","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined"}],"files":"$W33","stdlib":"1","titling":"auto"}} 2e:"$2d:body"