←back to thread

99 points agnishom | 1 comments | | HN request time: 0.217s | source
1. taeric ◴[] No.44366358[source]
I'm curious how this would look using an exact covering algorithm. I'm also vaguely curious to see the various solutions that have been explored lately benchmarked. For that matter, a table that gives the stats on the code and execution would almost certainly lead to some amusing fights.