 <hr> The first example is from CSE 521, our introductory algorithms course. The puzzle is to develop an algorithm for the following modification of the "travelling salesperson problem", known as the  "Travelling Tourist" problem:  Given a list of cities, and a schedule of buses that leave each city, design a travel plan that visits each city at least once, ends up where you started, and takes a small amount of time. The <a href="http://www.cs.washington.edu/homes/eric/java/TravellingTourist.html"><img src=http://www.cs.washington.edu/homes/eric/java/car.gif alt="" align=bottom> applet </a> illustrates some of the possible tours, on a sample <a href="http://www.cs.washington.edu/homes/eric/java/ttdataset.html">  <td>
