Baipyrus/AoC-23
1
0
Fork 0
mirror of https://github.com/Baipyrus/AoC-23.git synced 2024-12-26 12:01:45 +00:00
Code Issues Packages Projects Releases Wiki Activity

find best choice in open set

Browse Source
This commit is contained in:
Baipyrus 2024-01-27 23:52:14 +01:00
parent 5fa907c64e
commit 32ee792157
1 changed files with 14 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
Day17/Part1.js
View File

@ -20,6 +20,20 @@ const start = input[0][0];
const end = input.slice(-1)[0].slice(-1)[0]; const end = input.slice(-1)[0].slice(-1)[0];
const open = [start], closed = []; const open = [start], closed = [];
while (open.length > 0) {
let record = {};
for (const [index, next] of Object.entries(open)) {
const distance = next.g + next.h;
if (record?.distance ?? -1 < distance) {
record.distance = distance;
record.index = +index;
}
}
const current = open.splice(record.index, 1)[0];
closed.push(current);
if (current === end) break;
}
console.log(end.g); console.log(end.g);
const t1 = performance.now(); const t1 = performance.now();