I will give you a file providing the altitudes for every point within a square grid. Your trip starts at the upper left, goes to the lower right, and then returns. Each move you make will take you to an adjacent grid point. I'll tell you how many moves you may make to accomplish the round trip.
|The picture at the left is a graphical representation of the 30x30 system test problem with black representing zero altitude and white representing maximum altitude. Gray-scales represent intermediate altitudes.|
Your task: within the given number of moves, both minimize and maximize the "vertical" distance traveled. Think of it as a map of mountain ranges ... do as little climbing as possible while going, then take the "scenic tour" on your return home.
There ARE other constraints and rules you'll need to know about.
|ALL THE DETAILS AT THIS LINK!!!|
Check out all the detailed rules at the above link. THEN if you want to be part of the weekly status and FAQ mailings, you should send me some email ... put the word "ENTER" in the subject line of your email and send it off to:
As always - if your email has changed or you wish to be removed from this list, just drop me a note at that address.
*** http://www.cs.washington.edu/homes/corin/POTM.PAGES/ for the USofA *** http://www.ines.ro/potm/ in Europe *** http://potm.ffast.att.com/ INSIDE AT&T only *** http://icds.micro.lucent.com/POTM INSIDE Lucent only