Long version of the problem.
Information about the winner and the solution
Back to the list of problems.
Short Problem Description
This was the FALL 1996 POTM ... send email to email@example.com
and ask for all the details ...
The deadline for entering was Midnight December 31st, 1995 ...
On to the problem:
K N I G H T C R A W L E R
A cross between the classic knight's tour problem and the traveling
salesman problem to entice you this time.
Your program will plan the
route of a traveling salesman with a strange affliction causing him
to move in the manner of a chess knight. Your job will be to visit
a collection of locations on a map grid
and then return home. But each move you make
must be the classic "L" of the chess knight. I'll give you a bunch of
places to visit and you give me the best route. Cover all the spots with
the smallest number of knight's moves and you just may win!!!
The problem requires NO knowledge of chess, sales techniques, or crawling.
But you gotta be able to write some code to compete!
If you want to compete - you'll need the details. Simply send mail to
firstname.lastname@example.org and I'll ship you the details and put you on the
weekly status mailing list for this problem.
email@example.com [or, if this bounces:]
firstname.lastname@example.org [or, as a last resort:]
Hope you'll consider having some fun and entering this one!!! Deadline
will be 11:59 PM EST on December 31, 1995 - BUT, as previous
participants will tell you - it PAYS to enter early (you can always
update your entry as often as you wish!)