11–20 of 38 posts
Someone in class responded immediately: "Build another bridge."
The prof congratulated him on his lateral thinking.
Then they have the problem of so many people using an itinerary that it starts warping its own data and thinking places are more popular than they should be based on people getting there from their own recommendations.
cool problems to solve though
In one of my Engineering classes back in the day, our prof told us about the Euler algorithm and that it was impossible to stay off the island in the middle if you could only cross each bridge once and if there were an odd number of bridges. Someone in class responded immediately: "Build another bridge." The prof congratulated him on his lateral thinking.
I always appreciate three hours of deep compsci thinking interrupted by someone outside saying "why wouldn't we just run an extra cable?" or something. I'm glad your professor encouraged it, because it is very often useful.
In one of my Engineering classes back in the day, our prof told us about the Euler algorithm and that it was impossible to stay off the island in the middle if you could only cross each bridge once and if there were an odd number of bridges. Someone in class responded immediately: "Build another bridge." The prof congratulated him on his lateral thinking.
May be this is lateral thinking to some people but it's actually changing the problem and not solving the original problem.
I can always to pretend to solve the problem by just changing it.
Respectfully submitted.
In one of my Engineering classes back in the day, our prof told us about the Euler algorithm and that it was impossible to stay off the island in the middle if you could only cross each bridge once and if there were an odd number of bridges. Someone in class responded immediately: "Build another bridge." The prof congratulated him on his lateral thinking.
>>The prof congratulated him on his lateral thinking. May be this is lateral thinking to some people but it's actually changing the problem and not solving the original problem. I can always to pretend to solve the problem by just changing it. Respectfully submitted.
In one of my Engineering classes back in the day, our prof told us about the Euler algorithm and that it was impossible to stay off the island in the middle if you could only cross each bridge once and if there were an odd number of bridges. Someone in class responded immediately: "Build another bridge." The prof congratulated him on his lateral thinking.
In this case, both figuratively and literally lateral. I always appreciate three hours of deep compsci thinking interrupted by someone outside saying "why wouldn't we just run an extra cable?" or something. I'm glad your professor encouraged it, because it is very often useful.
Earlier quoted context omitted.
Ummm no. You read only the first few sentences. Google sought out to also solve the TSP and used the 50 year old Christofides algorithm which is built on top of Euler's bridge problem (graph theory) solution.
Guilty as charged - and worse: all I cared about was the source of the 280 years figure, as used in the disingenuous and clickbaity phrase "280-Year-Old Algorithm." I was being all meta. Edit: Also a variation on the TSP was part of my senior project so I am forever traumatized.
And the crowd has a lot more wisdom to offer in the future. For example, we noticed that visits to Buckingham Palace spike around 11:30 and stay a bit longer than at other times of the day. This seemed a little strange to us, but when we looked more closely, it turns out to be the time of the Changing of the Guard. We’re looking now at ways to incorporate this type of timing information into the itinerary selection algorithms.
Earlier quoted context omitted.
Guilty as charged - and worse: all I cared about was the source of the 280 years figure, as used in the disingenuous and clickbaity phrase "280-Year-Old Algorithm." I was being all meta. Edit: Also a variation on the TSP was part of my senior project so I am forever traumatized.
Is there an exact solution to the TSP?
There are simple <=2x and slightly more complicated <=1.5x guaranteed approximate solutions on metric spaces, but on most spaces there aren't even approximate solutions.