From 0da07275d02d53f29341235c24225d619964de7e Mon Sep 17 00:00:00 2001 From: Yanick Champoux Date: Wed, 8 Dec 2021 12:45:55 -0500 Subject: [PATCH] first draft --- 2021/08/part1.mjs | 34 +++++++++++++ 2021/08/part2.mjs | 122 ++++++++++++++++++++++++++++++++++++++++++++++ 2021/08/sample | 10 ++++ 2021/08/sample0 | 1 + 2021/08/test.mjs | 34 +++++++++++++ 5 files changed, 201 insertions(+) create mode 100644 2021/08/part1.mjs create mode 100644 2021/08/part2.mjs create mode 100644 2021/08/sample create mode 100644 2021/08/sample0 create mode 100644 2021/08/test.mjs diff --git a/2021/08/part1.mjs b/2021/08/part1.mjs new file mode 100644 index 0000000..b68a952 --- /dev/null +++ b/2021/08/part1.mjs @@ -0,0 +1,34 @@ +import fs from "fs-extra"; +import fp from "lodash/fp.js"; +import _ from "lodash"; + +export const digits = { + 0: 'abcefg', // 6 + 1: 'cf', // 2 + 2: 'acdeg', // 5 + 3: 'acdfg', // 5 + 4: 'bcdf', // 4 + 5: 'abdfg', // 5 + 6: 'abdefg', // 6 + 7: 'acf', // 3 + 8: 'abcdefg',// 7 + 9: 'abcdfg', // 6 +} + +export const processInput = (lines) => { + return lines.split("\n").filter(x=>x).map( line => { + let [ input, output ] = line.split(' | ').map( + x => x.split(' ').map( x => x.split('').sort() ) + ); + + return {input, output}; + } + ) +}; + +/** @return {number} */ +export function solution(lines) { + return lines.map(fp.get('output')).flat().filter( + x => [2,4,3,7].includes(x.length ) + ).length +} diff --git a/2021/08/part2.mjs b/2021/08/part2.mjs new file mode 100644 index 0000000..728d567 --- /dev/null +++ b/2021/08/part2.mjs @@ -0,0 +1,122 @@ +import fs from "fs-extra"; +import fp from "lodash/fp.js"; +import _ from "lodash"; + +import * as p1 from './part1.mjs'; + +function decodedDigits(mapping) { + const s = fp.invert(mapping); + let solution = fp.invert(p1.digits); + solution = fp.mapKeys( + k => k.split('').map( + l => s[l] + ).join('') + ,solution ); + + solution = fp.mapKeys( k => { k = k.split('').sort().join(''); return k }, solution ); + + return solution; +} + +function guess(unknowns,guessed={},inputs) { + console.log({unknowns,guessed}); + + const [ next ] = Object.keys(unknowns); + + if(!next) return guessed; + + + if(unknowns[next].size === 0) return; + + + for ( const p of unknowns[next].values() ) { + let newUnknowns = fp.omit(next, unknowns); + newUnknowns = fp.mapValues( + s => { + const x = new Set(s.values()); + x.delete(p); + return x; + }, newUnknowns ); + + //console.log({ newUnknowns }) + if( + Object.values(newUnknowns).some( s => s.size === 0 ) + ) continue; + + const r = guess( newUnknowns, { ...guessed, [next]: p }, inputs ); + if(r) { + const s = fp.invert(r); + let solution = fp.invert(p1.digits); + solution = fp.mapKeys( + k => k.split('').map( + l => s[l] + ).join('') + ,solution ); + + solution = fp.mapKeys( k => { k = k.split('').sort().join(''); return k }, solution ); + + console.log({r, solution }); + console.log({inputs}) + + if( inputs.some( i => ! solution.hasOwnProperty(i.join('')) ) ) { + console.log("Oh noes"); + } else { + console.log("Oh yea"); + return r; + } + + } + } +} + +export function findMapping(input) { + const values = 'abcdefg'.split(''); + + const possibility = Object.fromEntries(values.map( + v => [ v, new Set(values) ] + )); + + for ( const seq of input ) { + const p = Object.values(p1.digits).filter( + d => d.length === seq.length + ).join('').split(''); + + for( const l of seq ) { + possibility[l] = new Set( + p.filter( x => possibility[l].has(x) ) + ); + } + // console.log(possibility); + } + + + + const one = input.find( i => i.length === 2 ); + const seven = input.find( i => i.length === 3 ); + const [a] = seven.filter( x => !one.includes(x) ); + + for( const l of Object.values(possibility) ) { + l.delete('a'); + } + + possibility[a] = new Set(['a']); + console.log(possibility); + + return guess(possibility,{},input); +} + +export function decodedOutput({input,output}) { + const mapping = findMapping([...input,...output]); + + const digits = decodedDigits(mapping); + + console.log({ digits, output }); + + return parseInt(output.map( e => digits[e.join('')] ).join('')); +} + +export function solution(input) { + + return _.sum( input.map( decodedOutput ) ); + +} diff --git a/2021/08/sample b/2021/08/sample new file mode 100644 index 0000000..c9f629b --- /dev/null +++ b/2021/08/sample @@ -0,0 +1,10 @@ +be cfbegad cbdgef fgaecd cgeb fdcge agebfd fecdb fabcd edb | fdgacbe cefdb cefbgd gcbe +edbfga begcd cbg gc gcadebf fbgde acbgfd abcde gfcbed gfec | fcgedb cgb dgebacf gc +fgaebd cg bdaec gdafb agbcfd gdcbef bgcad gfac gcb cdgabef | cg cg fdcagb cbg +fbegcd cbd adcefb dageb afcb bc aefdc ecdab fgdeca fcdbega | efabcd cedba gadfec cb +aecbfdg fbg gf bafeg dbefa fcge gcbea fcaegb dgceab fcbdga | gecf egdcabf bgf bfgea +fgeab ca afcebg bdacfeg cfaedg gcfdb baec bfadeg bafgc acf | gebdcfa ecba ca fadegcb +dbcfg fgd bdegcaf fgec aegbdf ecdfab fbedc dacgb gdcebf gf | cefg dcbef fcge gbcadfe +bdfegc cbegaf gecbf dfcage bdacg ed bedf ced adcbefg gebcd | ed bcgafe cdgba cbgef +egadfb cdbfeg cegd fecab cgb gbdefca cg fgcdab egfdb bfceg | gbdfcae bgc cg cgb +gcafb gcf dcaebfg ecagb gf abcdeg gaef cafbge fdbac fegbdc | fgae cfgab fg bagce diff --git a/2021/08/sample0 b/2021/08/sample0 new file mode 100644 index 0000000..42b3bfd --- /dev/null +++ b/2021/08/sample0 @@ -0,0 +1 @@ +acedgfb cdfbe gcdfa fbcad dab cefabd cdfgeb eafb cagedb ab | cdfeb fcadb cdfeb cdbaf diff --git a/2021/08/test.mjs b/2021/08/test.mjs new file mode 100644 index 0000000..30cc8f7 --- /dev/null +++ b/2021/08/test.mjs @@ -0,0 +1,34 @@ +// https://adventofcode.com/2021/day/08 + +import tap from "tap"; +import fs from "fs-extra"; + +import * as p1 from "./part1.mjs"; +import * as p2 from "./part2.mjs"; + +const sample0 = fs.readFile("sample0", "utf8").then(p1.processInput); +const sample = fs.readFile("sample", "utf8").then(p1.processInput); +const input = fs.readFile("input", "utf8").then(p1.processInput); + +tap.test("part1", async (t) => { + t.equal(p1.solution(await sample), 26); + t.equal(p1.solution(await input), 26); +}); + +tap.test("part2", async (t) => { + const [ s0 ] = await sample0; + t.match( + p2.findMapping([...s0.input,...s0.output]), { + d: 'a', + e: 'b', + a: 'c', + f: 'd', + g: 'e', + b: 'f', + c: 'g', + } + ); + t.match(p2.decodedOutput(s0),5353); + t.equal(p2.solution(await sample), 61229); + t.equal(p2.solution(await input), 1019355); +});