2d:null 2e:["$","title",null,{"children":"Day 12: n bodies, Advent of Code 2019 | Andreas Plesch | Observable"}] 33:T136b,md` The space near Jupiter is not a very safe place; you need to be careful of a big distracting red spot, extreme radiation, and a whole lot of moons swirling around. You decide to start by tracking the four largest moons: Io, Europa, Ganymede, and Callisto. After a brief scan, you calculate the position of each moon (your puzzle input). You just need to simulate their motion so you can avoid them. Each moon has a 3-dimensional position (x, y, and z) and a 3-dimensional velocity. The position of each moon is given in your scan; the x, y, and z velocity of each moon starts at 0. Simulate the motion of the moons in time steps. Within each time step, first update the velocity of every moon by applying gravity. Then, once all moons' velocities have been updated, update the position of every moon by applying velocity. Time progresses by one step once all of the positions are updated. To apply gravity, consider every pair of moons. On each axis (x, y, and z), the velocity of each moon changes by exactly +1 or -1 to pull the moons together. For example, if Ganymede has an x position of 3, and Callisto has a x position of 5, then Ganymede's x velocity changes by +1 (because 5 > 3) and Callisto's x velocity changes by -1 (because 3 < 5). However, if the positions on a given axis are the same, the velocity on that axis does not change for that pair of moons. Once all gravity has been applied, apply velocity: simply add the velocity of each moon to its own position. For example, if Europa has a position of x=1, y=2, z=3 and a velocity of x=-2, y=0,z=3, then its new position would be x=-1, y=2, z=6. This process does not modify the velocity of any moon. For example, suppose your scan reveals the following positions: ~~~ x=-1, y=0, z=2 x=2, y=-10, z=-7 x=4, y=-8, z=8 x=3, y=5, z=-1 Simulating the motion of these moons would produce the following: After 0 steps: pos= x=-1, y= 0, z= 2>, vel= x= 0, y= 0, z= 0> pos= x= 2, y=-10, z=-7>, vel= x= 0, y= 0, z= 0> pos= x= 4, y= -8, z= 8>, vel= x= 0, y= 0, z= 0> pos= x= 3, y= 5, z=-1>, vel= x= 0, y= 0, z= 0> After 1 step: pos=, vel= pos=, vel= pos=, vel= pos=, vel= After 2 steps: pos=, vel= pos=, vel= pos=, vel= pos=, vel= ... ~~~ Then, it might help to calculate the total energy in the system. The total energy for a single moon is its potential energy multiplied by its kinetic energy. A moon's potential energy is the sum of the absolute values of its x, y, and z position coordinates. A moon's kinetic energy is the sum of the absolute values of its velocity coordinates. Below, each line shows the calculations for a moon's potential energy (pot), kinetic energy (kin), and total energy:

Energy after 10 steps:
pot: 2 + 1 + 3 =  6;   kin: 3 + 2 + 1 = 6;   total:  6 * 6 = 36
pot: 1 + 8 + 0 =  9;   kin: 1 + 1 + 3 = 5;   total:  9 * 5 = 45
pot: 3 + 6 + 1 = 10;   kin: 3 + 2 + 3 = 8;   total: 10 * 8 = 80
pot: 2 + 0 + 4 =  6;   kin: 1 + 1 + 1 = 3;   total:  6 * 3 = 18
Sum of total energy: 36 + 45 + 80 + 18 = 179

In the above example, adding together the total energy for all moons after 10 steps produces the total energy in the system, 179. Here's a second example: ~~~ Every ten steps of simulation for 100 steps produces: After 0 steps: pos=, vel= pos=, vel= pos=, vel= pos=, vel= After 10 steps: pos=, vel= pos=, vel= pos=, vel= pos=, vel= After 20 steps: pos=, vel= pos=, vel= pos=, vel= pos=, vel= After 30 steps: pos=, vel= pos=, vel= pos=, vel= pos=, vel= ... Energy after 100 steps: pot: 8 + 12 + 9 = 29; kin: 7 + 3 + 0 = 10; total: 29 * 10 = 290 pot: 13 + 16 + 3 = 32; kin: 3 + 11 + 5 = 19; total: 32 * 19 = 608 pot: 29 + 11 + 1 = 41; kin: 3 + 7 + 4 = 14; total: 41 * 14 = 574 pot: 16 + 13 + 23 = 52; kin: 7 + 1 + 1 = 9; total: 52 * 9 = 468 Sum of total energy: 290 + 608 + 574 + 468 = 1940 ~~~ What is the total energy in the system after simulating the moons given in your scan for 1000 steps?`34:T76c,md`### --- Part Two --- ### All this drifting around in space makes you wonder about the nature of the universe. Does history really repeat itself? You're curious whether the moons will ever return to a previous state. Determine the number of steps that must occur before all of the moons' positions and velocities exactly match a previous point in time. For example, the first example above takes 2772 steps before they exactly match a previous point in time; it eventually returns to the initial state: ~~~ After 0 steps: pos=, vel= pos=, vel= pos=, vel= pos=, vel= After 2770 steps: pos=, vel= pos=, vel= pos=, vel= pos=, vel= After 2771 steps: pos=, vel= pos=, vel= pos=, vel= pos=, vel= After 2772 steps: pos=, vel= pos=, vel= pos=, vel= pos=, vel= ~~~ Of course, the universe might last for a very long time before repeating. Here's a copy of the second example from above: ~~~ ~~~ This set of initial positions takes 4686774924 steps before it repeats a previous state! Clearly, you might need to find a more efficient way to simulate the universe. How many steps does it take to reach the first state that exactly matches a previous state? `35:[] 31:{"id":"3fe1d8598ceb39c9","slug":"day-12-n-bodies-advent-of-code-2019","title":"Day 12: n bodies, Advent of Code 2019","thumbnail":"a0c49ba5eb47a2e01b8e56d0d722a955e0eeeb16c4218e2e4f03353f597a40b1","access_level":"public","create_time":"$D2019-12-12T11:56:59.295Z","update_time":"$D2019-12-13T20:18:08.679Z","view_time":null,"first_public_time":"$D2019-12-12T23:08:28.537Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"3a7167e5e638bcd0","login":"andreasplesch","name":"Andreas Plesch","avatar_url":"https://avatars-next.observableusercontent.com/4da1ba746a4b25e755d1c9b71ca1c72165a9c40e02aee1f3fcae880584d70c9c","tier":"starter_2024"},"version":390,"publish_version":390,"role":null,"authored":false,"authors":[{"type":"individual","id":"171053d51d09c7fc","login":"andreasplesch","name":"Andreas Plesch","avatar_url":"https://avatars-next.observableusercontent.com/4da1ba746a4b25e755d1c9b71ca1c72165a9c40e02aee1f3fcae880584d70c9c","tier":null}],"members":[{"type":"individual","id":"171053d51d09c7fc","login":"andreasplesch","name":"Andreas Plesch","avatar_url":"https://avatars-next.observableusercontent.com/4da1ba746a4b25e755d1c9b71ca1c72165a9c40e02aee1f3fcae880584d70c9c","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":{"id":"9b46032982715a60","slug":"aoc2019","title":"aoc2019","owner":{"id":"3a7167e5e638bcd0","login":"andreasplesch","name":"Andreas Plesch"}},"type":"notebook","body":{"title":"Day 12: n bodies, Advent of Code 2019","cells":[{"id":0,"value":"md`# Day 12: n bodies, Advent of Code 2019\n\nhttps://adventofcode.com/2019`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":8,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":87,"value":"md`After 1000 steps the total Energy is **${run(1000).totalE}**`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":17,"value":"puzzle = `\n\n\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":21,"value":"planets = function(puzzle) { \n return puzzle.replace(/[<=xyz\\n]/g,'').split('>').map(p => {\n const pos = p.split(',').map(Number);\n const pE = pos.map(Math.abs).reduce((a,v) => a+v);\n return {position: pos,\n velocity: [0, 0, 0],\n pE: pE,\n kE: 0,\n tE: 0\n }\n }).slice(0,-1);\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":42,"value":"updatePlanets = function (planets) {\n let dv, p1_d, p2_d;\n let velUpdate = planets.map((p1, i1) => { // go through planets\n dv = planets.reduce((acc, p2, i2) => //go through planets for pairs\n acc.map((v_d, d) => { //for each dimension\n p1_d = p1.position[d];\n p2_d = p2.position[d];\n if (p1_d < p2_d) { return v_d + 1 }\n if (p1_d > p2_d) { return v_d - 1 }\n return v_d // at same place or same planet\n })\n , [0, 0, 0]);\n return p1.velocity.map((v_d, d) => v_d + dv[d])\n });\n let pos, vel, pE, kE;\n return planets.map( (p, i) => { // update positions\n vel = velUpdate[i];\n pos = p.position.map( (p_d, d) => p_d + vel[d] ); // just add vel.\n pE = pos.map(Math.abs).reduce((a,v) => a+v); // compute energies\n kE = vel.map(Math.abs).reduce((a,v) => a+v);\n return {position: pos, velocity: vel, pE: pE, kE: kE, tE: pE*kE};\n })\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":53,"value":"run = function(steps, input = puzzle) {\n let totalE;\n let updatedPlanets = planets(input);\n return Array(steps + 1).fill({planets: updatedPlanets}).reduce((result, p) => { // just iterate\n updatedPlanets = updatePlanets(updatedPlanets);\n totalE = updatedPlanets.reduce( (a,p) => a + p.tE, 0 );\n return {planets: updatedPlanets, totalE: totalE}\n })\n} ","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":90,"value":"run(0)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":101,"value":"test1 = `\n\n\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":103,"value":"run(10, test1)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":115,"value":"$34","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":354,"value":"md`Exactly **${puzzleAnswer}** steps.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":133,"value":"answerPerDim = function(input, iterMax = 10000) {\n let hash, iter, current, universes;\n let repeats = [0, 1, 2].map(d => { // key is get repeats per dimension, then find smallest combo\n current = planets(input);\n universes = new Set(); //sets seem faster than arrays\n iter = iterMax;\n while (iter--) {\n //hash = current.reduce((a,p) => a+[p.pE, p.kE].join(), \"\"); //was useless, tE also\n hash = current.reduce((a, p) => a + //just all positions and velocities \n p.position[d].toString(34) + \n p.velocity[d].toString(34), \"\");\n // found_i = universes.indexOf(hash); //slower\n // for (found_i = 0; found_i < universes.length; found_i++) {\n // if ( hash === universes[found_i] ) { break; }\n // }\n if ( universes.has(hash) ) { break; }\n universes.add(hash);\n current = updatePlanets(current);\n }\n return universes.size\n })\n return repeats\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":155,"value":"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":232,"value":"factorize = function (n) {\n let fact = function (n) { // recursive has to be inside one cell\n for (let i=2; i < n/2; i++) {\n if (n % i == 0) { return [i].concat( fact( n/i )); } //if divisible save and fact. rest\n }\n return [n]; //tried all, has no factor\n }\n return fact(n);\n}\n ","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":332,"value":"answer = function(input) {\n return answerPerDim(input, 240000)\n .map(factorize)\n .reduce((a, v) => { // find necessary factors\n let r = Array.from(a);\n return a.concat(v.map(c => {\n let i = r.indexOf(c);\n if (i == -1) { return c } // need the factor\n r[i] = 1; // remove factor\n return 1;\n }))}, [])\n .reduce((a,v) => a * v, 1)\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":329,"value":"puzzleAnswer = answer(puzzle) ","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":276,"value":"Math.pow(4686774924,1/3)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W35","stdlib":"1","titling":"auto"}} 32:"$31:body"