[Purdue-pm] Mark's Travelling Capital Problem

Rick Westerman westerman at purdue.edu
Fri Feb 18 07:06:25 PST 2011


> 
> Here's a brief statement of the problem. Starting at any state capital
> in the lower 48 go to the other 47 state capitals visiting each
> capital
> only once. Figure out the longest and shortest path. 

Great circle (e.g., bird flight)?   Direct (e.g., mole tunneling)?   Driving distance?  

Or all three?


-- 
Rick Westerman 
westerman at purdue.edu

Bioinformatics specialist at the Genomics Facility.
Phone: (765) 494-0505           FAX: (765) 496-7255
Department of Horticulture and Landscape Architecture
625 Agriculture Mall Drive
West Lafayette, IN 47907-2010
Physically located in room S049, WSLR building



More information about the Purdue-pm mailing list