I'm kind of stuck with my a Linear programming taks....
Its about a guy trying to get into as many pubs as possible within 9 hours. There are 14 pubs located on a manhatten map (e.g. Pub 1 has to coordinates 4,9 and so on). The guy is moving at the speed of 1 lag (e.g. from 0,1 to 1,1) in 10 minutes. Now we have to find out the path with which he can visit most of the most pubs within 9 hours.
This sounds like a variant of the classic "Travelling Salesman Problem
". Lacking specific information, this exercise may be unsolveable.