←back to thread

218 points lapnect | 1 comments | | HN request time: 0.378s | source
1. taeric ◴[] No.42177033[source]
Fun write up, kudos!

At a glance, this feels like a good case for an exact cover algorithm. Would be neat to see how that compares, here.