3 ms·
A straight up implementation of TSP (I assume you mean the decision variant) needs some kind of door that shuts with a timer. How do you plan to encode arbitra
by algorias 13y ago
A straight up implementation of TSP (I assume you mean the decision variant) needs some kind of door that shuts with a timer.
How do you plan to encode arbitrary graphs? This poses a challenge for 2d platformers. In case of any 2d game, how do you encode non-planar graphs? You would need some kind of teleportation device.
A graph with few edges and large edge values will also be problematic if you plan on keeping your input size polynomial (in |V| and |E|), as you'd need a widget capable of encoding an arbitrarily long edge in constant map space.
Once you have solved all the above problems, feel free to write a paper about it ;).
- Dylan16807 13y agoThose features are nice but unnecessary. Just use planar graphs. Then you don't have to enforce single-visiting either. Limited scrolling will bound the longest edges but you don't need arbitrary edges. Only problems of a limited size will be able to fit in the limited memory of the game but that's still NP-complete over what does fit.