-
- We propose an optimization problem. There is no single solution. Do not know which is best. It's about finding the best solution according to specifications.
-
- The problem
-
There is a square grid of 11 x 11 points, total 121 points, on which to establish a route that starts at point A5 and, through a chain of segments whose ends are on the grid points, reaches the point K5.
- Each step, the line segment between two consecutive points, must be greater than the previous.
- The drive can connect dots in any direction but can not touch or cross itself.
- The objective of the problem is to determine the longest possible path.
-
- Reply
- Will be reported in the form presented below.
- The field trip will contain the coordinates of the points that make the journey in order to be connected. Each point is separated from the next by a space.
- Ultimately the answer in this field has the form A5 (multiple waypoints) K5
-
- Deadline to register responses
- Answers can be record until August 12, 2011 at 24:00
-
- Short example
- On a grid of twenty-five points establish a route from point A2 to the point E2.
- Answer should be: A2 A1 B2 B4 D2 A0 E5
- The path length is 15.32
-
|
|
- Awards
- A Mensa cap with logo to be delivered in Rosario, Argentina.
|
|
|
- Participate by sending your best answer!
-
- Grid for trip
-
-
- Form calculation help
- To facilitate the calculation of the length of the journey has prepared an
Excel spreadsheet for free download.
-
|
