So you have this Salesmen, see? And this Salesman needs to travel across seven bridges ... and these bridges may or may not exist, see? So this Salesman needs to travel across these bridges in the shortest amount of time, while evading the ... authorities. Show me your solution in P time, and you're hired.
On Wed, May 8, 2013 at 2:57 PM, Atom Powers <[email protected]> wrote: > > On May 7, 2013 9:15 AM, "Michael Tiernan" <[email protected]> > wrote: > > "Here's a situation, > > [describe computer version of Kobayashi Maru problem]. > > This sounds like fun. What are some of your favorite "unwinnable" > problems? > > _______________________________________________ > Discuss mailing list > [email protected] > https://lists.lopsa.org/cgi-bin/mailman/listinfo/discuss > This list provided by the League of Professional System Administrators > http://lopsa.org/ > > -- Joseph A Kern [email protected]
_______________________________________________ Discuss mailing list [email protected] https://lists.lopsa.org/cgi-bin/mailman/listinfo/discuss This list provided by the League of Professional System Administrators http://lopsa.org/
