This seems like it would be a fun competition, for those who don’t have way too much work to do already ... !! http://azspcs.com/Contest/Nearness …
-
This feels very similar to functions that choose pseudo-random sampling orders for progressively raytracing shadows etc.
I think the only flaw is, the competition is based on a fixed number of input problems, and you submit the output results, which means it's a battle over long-term search space. Would be better if "we run your program on N random examples, it has K seconds to output each result."
-
-
If the grid size is bounded at 30x30 all random examples are just relabelings of the canonical labeling. The best solution can be precomputed and mapped to the relabeling.
-
Given that there are 900! possibilities, I think the point is that the search space is way too large to precompute exhaustively.
-
(Less than that due to symmetry, etc, but yeah.)
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.