Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Day 23, that was a fun one!

It’s pretty easy to solve with an octree. My goal was run-time speed rather than quickest solution.

My octree solution runs in ~3 milliseconds. If memory serves, the Z3 solver took around 17 seconds on the same machine.

I made a nifty (imho) video that shows the octree traversal order. There’s no need to create irregular shapes.

https://www.forrestthewoods.com/blog/solving-advent-of-code-...



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: