2e:null 2f:["$","title",null,{"children":"Day 17: Set and Forget, Advent of Code, 2019 | Andreas Plesch | Observable"}] 34:Tc48,md` An early warning system detects an incoming solar flare and automatically activates the ship's electromagnetic shield. Unfortunately, this has cut off the Wi-Fi for many small robots that, unaware of the impending danger, are now trapped on exterior scaffolding on the unsafe side of the shield. To rescue them, you'll have to act quickly! The only tools at your disposal are some wired cameras and a small vacuum robot currently asleep at its charging station. The video quality is poor, but the vacuum robot has a needlessly bright LED that makes it easy to spot no matter where it is. An Intcode program, the Aft Scaffolding Control and Information Interface (ASCII, your puzzle input), provides access to the cameras and the vacuum robot. Currently, because the vacuum robot is asleep, you can only access the cameras. Running the ASCII program on your Intcode computer will provide the current view of the scaffolds. This is output, purely coincidentally, as ASCII code: 35 means #, 46 means ., 10 starts a new line of output below the current one, and so on. (Within a line, characters are drawn left-to-right.) In the camera output, # represents a scaffold and . represents open space. The vacuum robot is visible as ^, v, <, or > depending on whether it is facing up, down, left, or right respectively. When drawn like this, the vacuum robot is always on a scaffold; if the vacuum robot ever walks off of a scaffold and begins tumbling through space uncontrollably, it will instead be visible as X. In general, the scaffold forms a path, but it sometimes loops back onto itself. For example, suppose you can see the following view from the cameras: ~~~ ..#.......... ..#.......... #######...### #.#...#...#.# ############# ..#...#...#.. ..#####...^.. ~~~ Here, the vacuum robot, ^ is facing up and sitting at one end of the scaffold near the bottom-right of the image. The scaffold continues up, loops across itself several times, and ends at the top-left of the image. The first step is to calibrate the cameras by getting the alignment parameters of some well-defined points. Locate all scaffold intersections; for each, its alignment parameter is the distance between its left edge and the left edge of the view multiplied by the distance between its top edge and the top edge of the view. Here, the intersections from the above image are marked O: ~~~ ..#.......... ..#.......... ##O####...### #.#...#...#.# ##O###O###O## ..#...#...#.. ..#####...^.. ~~~ For these intersections: The top-left intersection is 2 units from the left of the image and 2 units from the top of the image, so its alignment parameter is 2 * 2 = 4. The bottom-left intersection is 2 units from the left and 4 units from the top, so its alignment parameter is 2 * 4 = 8. The bottom-middle intersection is 6 from the left and 4 from the top, so its alignment parameter is 24. The bottom-right intersection's alignment parameter is 40. To calibrate the cameras, you need the sum of the alignment parameters. In the above example, this is 76. Run your ASCII program. What is the sum of the alignment parameters for the scaffold intersections?`35:T1358,puzzle=`1,330,331,332,109,3862,1101,0,1182,15,1101,1465,0,24,1002,0,1,570,1006,570,36,102,1,571,0,1001,570,-1,570,1001,24,1,24,1106,0,18,1008,571,0,571,1001,15,1,15,1008,15,1465,570,1006,570,14,21101,58,0,0,1105,1,786,1006,332,62,99,21102,333,1,1,21101,73,0,0,1105,1,579,1102,0,1,572,1102,0,1,573,3,574,101,1,573,573,1007,574,65,570,1005,570,151,107,67,574,570,1005,570,151,1001,574,-64,574,1002,574,-1,574,1001,572,1,572,1007,572,11,570,1006,570,165,101,1182,572,127,102,1,574,0,3,574,101,1,573,573,1008,574,10,570,1005,570,189,1008,574,44,570,1006,570,158,1105,1,81,21101,340,0,1,1106,0,177,21101,477,0,1,1106,0,177,21101,514,0,1,21102,1,176,0,1105,1,579,99,21102,1,184,0,1106,0,579,4,574,104,10,99,1007,573,22,570,1006,570,165,1002,572,1,1182,21102,1,375,1,21102,211,1,0,1105,1,579,21101,1182,11,1,21101,0,222,0,1105,1,979,21101,0,388,1,21102,233,1,0,1106,0,579,21101,1182,22,1,21101,0,244,0,1106,0,979,21102,1,401,1,21102,255,1,0,1105,1,579,21101,1182,33,1,21102,1,266,0,1106,0,979,21102,1,414,1,21101,0,277,0,1106,0,579,3,575,1008,575,89,570,1008,575,121,575,1,575,570,575,3,574,1008,574,10,570,1006,570,291,104,10,21101,1182,0,1,21102,313,1,0,1105,1,622,1005,575,327,1101,1,0,575,21102,327,1,0,1105,1,786,4,438,99,0,1,1,6,77,97,105,110,58,10,33,10,69,120,112,101,99,116,101,100,32,102,117,110,99,116,105,111,110,32,110,97,109,101,32,98,117,116,32,103,111,116,58,32,0,12,70,117,110,99,116,105,111,110,32,65,58,10,12,70,117,110,99,116,105,111,110,32,66,58,10,12,70,117,110,99,116,105,111,110,32,67,58,10,23,67,111,110,116,105,110,117,111,117,115,32,118,105,100,101,111,32,102,101,101,100,63,10,0,37,10,69,120,112,101,99,116,101,100,32,82,44,32,76,44,32,111,114,32,100,105,115,116,97,110,99,101,32,98,117,116,32,103,111,116,58,32,36,10,69,120,112,101,99,116,101,100,32,99,111,109,109,97,32,111,114,32,110,101,119,108,105,110,101,32,98,117,116,32,103,111,116,58,32,43,10,68,101,102,105,110,105,116,105,111,110,115,32,109,97,121,32,98,101,32,97,116,32,109,111,115,116,32,50,48,32,99,104,97,114,97,99,116,101,114,115,33,10,94,62,118,60,0,1,0,-1,-1,0,1,0,0,0,0,0,0,1,6,30,0,109,4,1202,-3,1,587,20101,0,0,-1,22101,1,-3,-3,21102,0,1,-2,2208,-2,-1,570,1005,570,617,2201,-3,-2,609,4,0,21201,-2,1,-2,1105,1,597,109,-4,2106,0,0,109,5,1202,-4,1,630,20102,1,0,-2,22101,1,-4,-4,21101,0,0,-3,2208,-3,-2,570,1005,570,781,2201,-4,-3,653,20101,0,0,-1,1208,-1,-4,570,1005,570,709,1208,-1,-5,570,1005,570,734,1207,-1,0,570,1005,570,759,1206,-1,774,1001,578,562,684,1,0,576,576,1001,578,566,692,1,0,577,577,21102,702,1,0,1106,0,786,21201,-1,-1,-1,1106,0,676,1001,578,1,578,1008,578,4,570,1006,570,724,1001,578,-4,578,21102,731,1,0,1105,1,786,1106,0,774,1001,578,-1,578,1008,578,-1,570,1006,570,749,1001,578,4,578,21102,756,1,0,1106,0,786,1106,0,774,21202,-1,-11,1,22101,1182,1,1,21102,1,774,0,1106,0,622,21201,-3,1,-3,1105,1,640,109,-5,2105,1,0,109,7,1005,575,802,20101,0,576,-6,20101,0,577,-5,1106,0,814,21101,0,0,-1,21101,0,0,-5,21102,1,0,-6,20208,-6,576,-2,208,-5,577,570,22002,570,-2,-2,21202,-5,51,-3,22201,-6,-3,-3,22101,1465,-3,-3,2102,1,-3,843,1005,0,863,21202,-2,42,-4,22101,46,-4,-4,1206,-2,924,21102,1,1,-1,1105,1,924,1205,-2,873,21101,35,0,-4,1105,1,924,1201,-3,0,878,1008,0,1,570,1006,570,916,1001,374,1,374,1202,-3,1,895,1101,0,2,0,2101,0,-3,902,1001,438,0,438,2202,-6,-5,570,1,570,374,570,1,570,438,438,1001,578,558,921,21002,0,1,-4,1006,575,959,204,-4,22101,1,-6,-6,1208,-6,51,570,1006,570,814,104,10,22101,1,-5,-5,1208,-5,47,570,1006,570,810,104,10,1206,-1,974,99,1206,-1,974,1101,1,0,575,21101,0,973,0,1105,1,786,99,109,-7,2106,0,0,109,6,21101,0,0,-4,21101,0,0,-3,203,-2,22101,1,-3,-3,21208,-2,82,-1,1205,-1,1030,21208,-2,76,-1,1205,-1,1037,21207,-2,48,-1,1205,-1,1124,22107,57,-2,-1,1205,-1,1124,21201,-2,-48,-2,1106,0,1041,21101,0,-4,-2,1105,1,1041,21101,-5,0,-2,21201,-4,1,-4,21207,-4,11,-1,1206,-1,1138,2201,-5,-4,1059,2101,0,-2,0,203,-2,22101,1,-3,-3,21207,-2,48,-1,1205,-1,1107,22107,57,-2,-1,1205,-1,1107,21201,-2,-48,-2,2201,-5,-4,1090,20102,10,0,-1,22201,-2,-1,-2,2201,-5,-4,1103,1201,-2,0,0,1106,0,1060,21208,-2,10,-1,1205,-1,1162,21208,-2,44,-1,1206,-1,1131,1106,0,989,21101,439,0,1,1106,0,1150,21101,0,477,1,1105,1,1150,21101,514,0,1,21102,1,1149,0,1106,0,579,99,21101,0,1157,0,1106,0,579,204,-2,104,10,99,21207,-3,22,-1,1206,-1,1138,2101,0,-5,1176,2101,0,-4,0,109,-6,2106,0,0,4,13,38,1,11,1,38,1,11,1,38,1,11,1,38,1,11,1,38,1,11,1,34,5,11,1,15,13,6,1,15,1,15,1,11,1,6,1,15,1,15,1,11,1,6,1,15,1,15,1,11,1,6,1,15,1,15,1,11,1,6,1,15,1,15,1,11,1,6,1,5,11,15,1,11,1,6,1,31,1,11,1,6,1,31,1,11,1,6,1,31,1,11,1,6,9,23,1,1,11,14,1,23,1,1,1,24,1,23,7,20,1,25,1,3,1,20,1,9,7,7,11,16,1,9,1,5,1,7,1,1,1,3,1,3,1,16,1,7,11,5,1,1,1,3,1,3,1,16,1,7,1,1,1,5,1,1,1,5,1,1,1,3,1,3,1,16,1,7,1,1,1,5,11,3,1,3,1,16,1,7,1,1,1,7,1,5,1,5,1,3,1,16,11,7,7,5,1,3,1,24,1,21,1,3,1,24,1,21,7,22,1,25,1,1,1,12,11,25,9,44,1,5,1,44,1,5,1,44,1,5,1,34,11,5,1,34,1,15,1,34,1,15,1,34,1,15,1,34,1,15,1,34,1,15,1,34,1,11,5,34,1,11,1,38,1,11,1,38,1,11,1,38,1,11,1,38,1,11,1,38,13,4`36:T10ae,md`--- Part Two --- Now for the tricky part: notifying all the other robots about the solar flare. The vacuum robot can do this automatically if it gets into range of a robot. However, you can't see the other robots on the camera, so you need to be thorough instead: you need to make the vacuum robot visit every part of the scaffold at least once. The vacuum robot normally wanders randomly, but there isn't time for that today. Instead, you can override its movement logic with new rules. Force the vacuum robot to wake up by changing the value in your ASCII program at address 0 from 1 to 2. When you do this, you will be automatically prompted for the new movement rules that the vacuum robot should use. The ASCII program will use input instructions to receive them, but they need to be provided as ASCII code; end each line of logic with a single newline, ASCII code 10. First, you will be prompted for the main movement routine. The main routine may only call the movement functions: A, B, or C. Supply the movement functions to use as ASCII text, separating them with commas (,, ASCII code 44), and ending the list with a newline (ASCII code 10). For example, to call A twice, then alternate between B and C three times, provide the string A,A,B,C,B,C,B,C and then a newline. Then, you will be prompted for each movement function. Movement functions may use L to turn left, R to turn right, or a number to move forward that many units. Movement functions may not call other movement functions. Again, separate the actions with commas and end the list with a newline. For example, to move forward 10 units, turn left, move forward 8 units, turn right, and finally move forward 6 units, provide the string 10,L,8,R,6 and then a newline. Finally, you will be asked whether you want to see a continuous video feed; provide either y or n and a newline. Enabling the continuous video feed can help you see what's going on, but it also requires a significant amount of processing power, and may even cause your Intcode computer to overheat. Due to the limited amount of memory in the vacuum robot, the ASCII definitions of the main routine and the movement functions may each contain at most 20 characters, not counting the newline. For example, consider the following camera feed: ~~~ #######...##### #.....#...#...# #.....#...#...# ......#...#...# ......#...###.# ......#.....#.# ^########...#.# ......#.#...#.# ......######### ........#...#.. ....#########.. ....#...#...... ....#...#...... ....#...#...... ....#####...... ~~~ In order for the vacuum robot to visit every part of the scaffold at least once, one path it could take is: R,8,R,8,R,4,R,4,R,8,L,6,L,2,R,4,R,4,R,8,R,8,R,8,L,6,L,2 Without the memory limit, you could just supply this whole string to function A and have the main routine call A once. However, you'll need to split it into smaller parts. One approach is: ~~~ Main routine: A,B,C,B,A,C (ASCII input: 65, 44, 66, 44, 67, 44, 66, 44, 65, 44, 67, 10) Function A: R,8,R,8 (ASCII input: 82, 44, 56, 44, 82, 44, 56, 10) Function B: R,4,R,4,R,8 (ASCII input: 82, 44, 52, 44, 82, 44, 52, 44, 82, 44, 56, 10) Function C: L,6,L,2 (ASCII input: 76, 44, 54, 44, 76, 44, 50, 10) Visually, this would break the desired path into the following parts: A, B, C, B, A, C R,8,R,8, R,4,R,4,R,8, L,6,L,2, R,4,R,4,R,8, R,8,R,8, L,6,L,2 CCCCCCA...BBBBB C.....A...B...B C.....A...B...B ......A...B...B ......A...CCC.B ......A.....C.B ^AAAAAAAA...C.B ......A.A...C.B ......AAAAAA#AB ........A...C.. ....BBBB#BBBB.. ....B...A...... ....B...A...... ....B...A...... ....BBBBA...... ~~~ Of course, the scaffolding outside your ship is much more complex. As the vacuum robot finds other robots and notifies them of the impending solar flare, it also can't help but leave them squeaky clean, collecting any space dust it finds. Once it finishes the programmed set of movements, assuming it hasn't drifted off into space, the cleaning robot will return to its docking station and report the amount of space dust it collected as a large, non-ASCII value in a single output instruction. After visiting every part of the scaffold at least once, how much dust does the vacuum robot report it has collected?`37:T4a7,path = { // find move combo recursively: solution is move + solution of shorter path and one less move option // moves: array of moves (<= 3) // move: array of segments (<= 10) let path3F = function(segs, moves, prog){ if (segs.length == 0) { return [prog, moves, segs] } // found a solution let m = moves.findIndex(m => m.join() == segs.slice(0, m.length).join()); if (m !== -1) { return path3F(segs.slice(moves[m].length), moves, prog.concat(m)); } //could use existing move, add to prog let slot = [0,1,2].find(m => !prog.includes(m)); if (slot == undefined) { return false } let window = Math.floor(segs.length / 2); while (window-- > 1) { // try all moves m = segs.slice(0, window); if (m.join(',').length > maxmem) { continue; } // too long moves[slot] = m; let path = path3F(segs.slice(window), moves, prog.concat(slot)); // try shorter path if (path) {return path} // should not happen } return false;//[2, segs, moves, prog] // tried all here, try next in upper slot } //debugger; return path3F(segments.map(s => s.turn+","+s.steps), [], []) } 38:Tb36,function intcomp (program, input = [], pc = 0, memstart, relbase = 0) { let outputLog = []; let inputs = input;//[input]; //if (pc == 0) inputs.push(phase); // better have explicit init option let mem = program.map(Number); let start = memstart || 0; let op, opcode, modes, x, p1, p2, p3, offset, output, i, step, ampOut=[], wait = false; let mode2calcAddress = { 0: i => mem[i]+start, 1: i => i, 2: i => mem[i]+start+relbase }; for (i = pc; i < program.length; i += step) { op = mem[i].toString().padStart(6, 0); output = i.toString().padStart(4, 0) + ": " + op + " "; opcode = op.slice(-2); modes = op.slice(0, -2).split('').reverse(); if ( !modes.every( m => m === '0' || m === '1' || m === '2') ) { outputLog.push (output + 'unknown mode: ' + modes); break; } if (opcode == '99') break p1 = mem[mode2calcAddress[modes[0]](i+1)] || 0; //memory needs to initialized to 0s, not documented p2 = mem[mode2calcAddress[modes[1]](i+2)] || 0; p3 = mode2calcAddress[modes[2]](i+3) || 0; // p3 is always address directly, no lookup step = 4; switch (opcode) { case '01': mem[p3] = p1 + p2; output += [p1, p2, p3, mem[p3]].join(); break; case '02': mem[p3] = p1 * p2; output += [p1, p2, p3, mem[p3]].join(); break; case '03': //input if (inputs.length == 0) { wait = true; break }; // wait for next input step = 2; offset = mode2calcAddress[modes[0]](i+1); // no indirection mem[offset] = inputs.pop(); output += 'input ' + mem[offset] + " to " + offset; break; case '04': //output step = 2; output += (p1 != 0 ? "### " : "ok! ") + mode2calcAddress[modes[0]](i+1) + ' output: ' + p1; ampOut.push(p1); break; case '05': step = 3; if (p1 != 0) { i = p2 - step; } output += p1 + ' != 0: jumpT ' + (p2); break; case '06': step = 3; if (p1 == 0) { i = p2 - step; } output += 'jumpF ' + (i + step); break; case '07': // x = 0; // if (p1 < p2) { x = 1 } mem[p3] = p1 < p2 ? 1 : 0; output += p1 + ' less ' + p2 + ": " + mem[p3]; break; case '08': // x = 0; // if (p1 == p2) { x = 1 } mem[p3] = p1 == p2 ? 1 : 0; output += p1 + ' == ' + p2 + ' into ' + p3; break; case '09': step = 2; relbase += p1; output += 'relative base: ' + relbase; break; default: output += 'unknown opcode: ' + opcode; break; } if (wait) break; outputLog.push(output); } return {value: ampOut, opcode: opcode, mem: mem, pc: i, relbase: relbase} }39:[] 32:{"id":"f84602fe18ceac31","slug":"day-17-set-and-forget-advent-of-code-2019","title":"Day 17: Set and Forget, Advent of Code, 2019","thumbnail":"c4230d46370c466a364746ceb0f1b466c7b598b6bd755c116eb01777455ce198","access_level":"public","create_time":"$D2019-12-18T19:32:23.211Z","update_time":"$D2019-12-20T03:56:14.339Z","view_time":null,"first_public_time":"$D2019-12-20T03:56:34.179Z","has_unpublished_edits":null,"fork":false,"stars":1,"starred":false,"owner":{"type":"team","id":"3a7167e5e638bcd0","login":"andreasplesch","name":"Andreas Plesch","avatar_url":"https://avatars-next.observableusercontent.com/4da1ba746a4b25e755d1c9b71ca1c72165a9c40e02aee1f3fcae880584d70c9c","tier":"starter_2024"},"version":253,"publish_version":253,"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":2,"collection":{"id":"9b46032982715a60","slug":"aoc2019","title":"aoc2019","owner":{"id":"3a7167e5e638bcd0","login":"andreasplesch","name":"Andreas Plesch"}},"type":"notebook","body":{"title":"Day 17: Set and Forget, Advent of Code, 2019","cells":[{"id":111,"value":"md`# Day 17: Set and Forget, Advent of Code, 2019`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":29,"value":"html`

${viewtxt}

`\n","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":0,"value":"$34","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":79,"value":"md`The sum of the alignment parameters is **${part1}**`","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":9,"value":"$35","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":12,"value":"program = puzzle.split(\",\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":15,"value":"view = intcomp(program).value","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":48,"value":"view.slice(-4)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":36,"value":"dims = {\n const y = view.filter( v => v == '\\n'.charCodeAt(0) ).length - 1;\n const x = (view.length - 1) / y; // extra newline at very end\n return {x:x, y:y} // includes newline at end of line\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":63,"value":"intersections = {\n const wall = '#'.charCodeAt(0);\n return view.map((v, i) => {\n if (v == wall) {\n if ( view[i-1] == wall && view[i+1] == wall &&\n view[i-dims.x] == wall && view[i+dims.x] == wall ) {\n return [(i % dims.x), Math.floor(i / dims.x)];\n }}\n return 0\n })\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":74,"value":"part1 = intersections.filter( v => v != 0 ).reduce((a,v) => a+v[0]*v[1], 0)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":18,"value":"viewtxt = view.map( v => String.fromCharCode(v) ).join('')","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":77,"value":"$36","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":245,"value":"md`The robot reports **${dustvalue}** dust.`","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":117,"value":"maxmem = 20;","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":123,"value":"hashes = view.filter(v => v == '#'.charCodeAt(0)).length","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":125,"value":"pathlength = hashes + intersections.filter(v=>v!=0).length;","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":82,"value":"segments = {\n let walking=1000;\n const inc = [-dims.x, 1, dims.x, -1];\n const wall = '#'.charCodeAt(0);\n let segs = [];\n let current, counter = 0, turn = 'R';\n let start = view.indexOf('^'.charCodeAt(0));\n let dir = 0; // 0 to 3 is keep turning right: N,E,S,W\n while (walking--) {\n //go straight\n start += inc[dir];\n if (view[start] == wall) { // good\n counter++; continue;\n }\n segs.push({turn:turn, steps:counter});\n //off rail\n start -= inc[dir];\n counter = 0;\n //check where to turn\n if (view[start+inc[(dir+1)%4]] == wall) {// turn right \n turn = 'R';\n dir = (dir+1)%4;\n continue;\n }\n if (view[start+inc[(dir+3)%4]] == wall) {// turn left\n turn = 'L';\n dir = (dir+3)%4;\n continue;\n }\n break;\n }\n return segs.slice(1);\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":90,"value":"sequences = {\n let window = 21;//Math.floor(segments.length/2);\n let seqs = [], seq1, seq2, ws = [];\n while (window-- > 1) {\n let i = 0;\n while (i < segments.length - window) {\n seq1 = segments.slice(i, i+window).map(v => [v.turn,v.steps].join()).join();\n if (seq1.length > maxmem) { i++; continue; }\n let slength = seq1.split(',').length/2;\n let j = i+window, k=1;\n while (j < segments.length - window) {\n seq2 = segments.slice(j, j+window).map(v => [v.turn,v.steps].join()).join();\n if (seq1 == seq2) { k++ ; }\n //.map(Number).filter(v=>v>0).reduce((a,v)=>a+v,0);\n \n j += 1;// window;\n }\n seqs.push(seq1, [i,j,window, k*slength]);\n //if (seq1 == seq2) { break; }\n i++;\n }\n }\n return [seqs.map(v=>v),ws]\n}\n ","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":162,"value":"$37","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":183,"value":"dust = {\n function tocharCode(s) {return s.map(v => v.charCodeAt(0))}\n \n const cmds = ['A','B','C'];//.map(v => v.charCodeAt(0));\n let main = (path[0].map(v => cmds[v]).join(',')+'\\n').split('');\n let moves = path[1].map(m => (m.join(',')+'\\n').split(''));\n let feed = (\"n\"+'\\n').split('');\n let input = main.concat(...moves,feed);\n let prog = program;\n prog[0] = 2;\n //return tocharCode(input).reverse()\n return intcomp(prog, tocharCode(input).reverse())\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":229,"value":"html`

${\ndust.value.map( v => String.fromCharCode(v) ).join('')\n}

`\n","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":237,"value":"dustvalue = dust.value.slice(-1)[0]","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":6,"value":"$38","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W39","stdlib":"1","titling":"auto"}} 33:"$32:body"