From owner-freebsd-chat@FreeBSD.ORG Sat Nov 1 13:10:14 2003 Return-Path: Delivered-To: freebsd-chat@freebsd.org Received: from mx1.FreeBSD.org (mx1.freebsd.org [216.136.204.125]) by hub.freebsd.org (Postfix) with ESMTP id 43A5816A4CE for ; Sat, 1 Nov 2003 13:10:14 -0800 (PST) Received: from razorbill.mail.pas.earthlink.net (razorbill.mail.pas.earthlink.net [207.217.121.248]) by mx1.FreeBSD.org (Postfix) with ESMTP id 932D243FCB for ; Sat, 1 Nov 2003 13:10:13 -0800 (PST) (envelope-from tlambert2@mindspring.com) Received: from user-38ldtjc.dialup.mindspring.com ([209.86.246.108] helo=mindspring.com) by razorbill.mail.pas.earthlink.net with asmtp (SSLv3:RC4-MD5:128) (Exim 3.33 #1) id 1AG30d-00013a-00; Sat, 01 Nov 2003 13:10:12 -0800 Message-ID: <3FA41FAC.664CC457@mindspring.com> Date: Sat, 01 Nov 2003 13:03:40 -0800 From: Terry Lambert X-Mailer: Mozilla 4.79 [en] (Win98; U) X-Accept-Language: en MIME-Version: 1.0 To: Bill Moran References: <3FA29783.8060804@potentialtech.com> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-ELNK-Trace: b1a02af9316fbb217a47c185c03b154d40683398e744b8a4ec05f0b8c2ffc1dd8cfaeb478c33d0e5350badd9bab72f9c350badd9bab72f9c350badd9bab72f9c cc: chat@freebsd.org Subject: Re: How do hackers drive? X-BeenThere: freebsd-chat@freebsd.org X-Mailman-Version: 2.1.1 Precedence: list List-Id: Non technical items related to the community List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sat, 01 Nov 2003 21:10:14 -0000 Bill Moran wrote: > When I am about to go somewhere in the car, I take a moment or two to > plan out the optimal route to get to my various destinations. I use destination proximity planning, so te last leg is provisional; for example, last night I went up to San Francisco, and there was a chemical spill that blocked the left two lanes of 280 North, near Belmont. Hearing about the spill on the radio, I was able to alter my route and avoid unreasonable delays. If I had planned every inch, then any deviation from the route would have been impossible, unless I already knew the area well (which is not always possible on things like long trips). > If there are multiple destinations, I usually do a little thinking > to determine what order to visit these destinations in order to make > optimal use of my time. Travelling salesman problem. People familiar with the problem (CS, graph theory, actual travelling salesmen, etc.) tend to do this; other people do not tend to perceive it as a problem. > This is usually modified by the desire to choose a route that includes the > fewest number of left turns possible (since right turns are cheaper than > left turns, time-wise, and complexity-wise - you can make a right turn on > red for crying out loud) > > Other programmers drive this way as well, correct? Not entirely. 8-). > The revelation is that I'm starting to understand that many non-programmer > _don't_ generally evaluate their car trips like this. I mean, I know that > most people will plan out a route when they're going on a long trip, but > this planning procedure occurs _every_ time I get in the car, even if I'm > just going to the convenience store for some chips (I have to evaluate the > fact that there are two convenience stores equaldistance from here, one is > a less complex journey, while the other has a better selection!) Most programmers do not drive this way. They compute the result once, and then use a cached copy for subsequent trips. 8-) 8-). -- Terry