Re:Easy problem
by
Anonymous Coward
·
· Score: 1, Interesting
No, the problem is discretized. Plus there's only one test case. It's an easy problem.
Shortest path will work (your possible moves are the 7 thruster configurations, not NSEW.. but still shortest path). And because you can precaculate it, you don't even have to use a very efficient shortest path.
You can MAKE it into a shortest path problem.
by
jgoemat
·
· Score: 2, Interesting
You'd have to make a point on your graph for every possible pixel/velocity combination and link them together by each possible thrust value. You'd end up with on the order of 200,000 points and 600,000 or so links.
Slashdot Mirror
No, the problem is discretized. Plus there's only one test case. It's an easy problem.
Shortest path will work (your possible moves are the 7 thruster configurations, not NSEW.. but still shortest path). And because you can precaculate it, you don't even have to use a very efficient shortest path.
You'd have to make a point on your graph for every possible pixel/velocity combination and link them together by each possible thrust value. You'd end up with on the order of 200,000 points and 600,000 or so links.