AdventOfCode2022 VS adventofcode

Part 1 : I just implemented a very careful simulation, using a set to store elves positions and a few auxiliary functions to check all directions.

Part 1 : Iterate over all nodes, solving for those for which we know their children already.

Part 1 is just a careful DFS implemented iteratively (no recursion), using (time, location, valves_opened) => score as a criteria to check if it is worth to explore a state or not. At every state, I add a new branch if we can open a valve in the current location AND one new branch for every possible new valve to visit.

The only code differs for two parts is as follows - https://github.com/bhosale-ajay/adventofcode/blob/master/2023/ts/D07.test.ts - under 80 lines.

Easy day TypeScript, P1 - Brute Force, P2 - Formula

[LANGUAGE: TypeScript] Github - Under 40 lines, all parts running under 8ms.

[LANGUAGE: TypeScript] TypeScript - Running under 30ms (both parts)

F# This year I solved puzzles using TypeScript as well as F# - Day 18, 19, and 22 TBD

F# - After looking at some Python solution calculated the position of blizzard for nth time instead of maintaining the grid, which makes it easier with F#.