Day 20 #adventofcode in the books.
Yet more grid path finding. This time a variant on finding better paths by removing a set amount of obstacles.
Part 1 was removing one obstacle at any given point, and summing up the amount of paths which showed a set amount of improvement.
The wording of the questions this year has been made deliberately strange - I assume to defeat AI, but its proving difficult for I too. For two hours I fought thinking it meant removing two obstacles.
Part 2 upped the ante to 20 obstacles. I had to change my approach from part 1 fairly drastically to get this to work.
[#]typescript worked well for this.
=> More informations about this toot | View the thread | More toots from walkerb@infosec.exchange
=> View adventofcode tag | View typescript tag This content has been proxied by September (ba2dc).Proxy Information
text/gemini