96 lines
2.3 KiB
JavaScript
96 lines
2.3 KiB
JavaScript
import * as R from "remeda";
|
|
import Victor from "@a-robu/victor";
|
|
|
|
import { readFile } from "../05/part1.js";
|
|
|
|
const V = (x,y) => new Victor(x,y);
|
|
|
|
const readInput = (...args) =>
|
|
R.pipe(
|
|
readFile(...args),
|
|
(lines) => lines.split("\n"),
|
|
R.compact, // remove last line
|
|
R.map((line) => line.split("").map( c => c ==='S' ? '`' : c === 'E' ? '{' : c ))
|
|
);
|
|
|
|
export const puzzleInput = readInput(import.meta.url, "input");
|
|
export const sample = readInput(import.meta.url, "sample");
|
|
|
|
export const findStart = (topoMap) => {
|
|
let y;
|
|
let x = R.findIndex(topoMap, (row) => {
|
|
let z = row.indexOf("`");
|
|
if (z === -1) return false;
|
|
y = z;
|
|
return true;
|
|
});
|
|
return V(x,y);
|
|
};
|
|
|
|
export const findEnd = (topoMap) => {
|
|
let y;
|
|
let x = R.findIndex(topoMap, (row) => {
|
|
let z = row.indexOf("{");
|
|
if (z === -1) return false;
|
|
y = z;
|
|
return true;
|
|
});
|
|
return V(x,y);
|
|
};
|
|
|
|
const directions = [ [0,1], [0,-1],[1,0],[-1,0] ].map(
|
|
d => V(...d)
|
|
);
|
|
|
|
const outOfMap = (maxX,maxY) => (loc) => {
|
|
if( Math.min( loc.x, loc.y ) < 0 ) return true;
|
|
if( loc.x >= maxX ) return true;
|
|
if( loc.y >= maxY ) return true;
|
|
return false;
|
|
}
|
|
|
|
const isReachable = (topoMap,pos) => {
|
|
const baseline = topoMap[pos.x][pos.y].charCodeAt(0);
|
|
|
|
return (next) => {
|
|
return topoMap[next.x][next.y].charCodeAt(0) - baseline <= 1;
|
|
}
|
|
}
|
|
|
|
function findShortestPath(topoMap) {
|
|
const initial = findStart(topoMap);
|
|
initial.steps = 0;
|
|
const final = findEnd(topoMap);
|
|
|
|
const potentials = [ initial ];
|
|
|
|
const beenThere = topoMap.map(
|
|
line => line.map( () => 9999 )
|
|
);
|
|
|
|
const oom = outOfMap(topoMap.length,topoMap[0].length );
|
|
|
|
let failsafe = 10; //topoMap.length*topoMap[0].length ;
|
|
while( potentials.length > 0 ) {
|
|
// if(! failsafe--) return;
|
|
const pos = potentials.shift(); // depth-first
|
|
|
|
if( beenThere[pos.x][pos.y] <= pos.steps ) continue;
|
|
beenThere[pos.x][pos.y] = pos.steps;
|
|
|
|
const next = directions.map(
|
|
d => d.clone().add(pos)
|
|
).filter( R.isNot(oom ))
|
|
.filter( isReachable(topoMap,pos) );
|
|
|
|
next.forEach( n => n.steps = pos.steps + 1 );
|
|
|
|
potentials.push(...next);
|
|
}
|
|
|
|
return beenThere[final.x][final.y];
|
|
|
|
}
|
|
|
|
export default findShortestPath;
|