P362 Euclid Manhattan and Chebyshev
Back to General discussions forum
Hi Rodion,
Many thanks for this little new problem. I think the checker works fine, but the answer for the example misses the return back to the starting point.
Hi Mathias! Thanks for quick reaction, fixed!
BTW I was much impressed by your finding to mazes problem (and somewhat surprised to meet Herr Kirchhoff beyond the field of physics of electric currents) - thus mentioned your approach at the problem's notes. Thanks for researching and sharing this!
I wonder if there is convenient way to generalize this problem with distances.
Hello,
after several tries I still get "Your answer is wrong", which is ok but leads me to ask two questions:
1) Do the three persons all start at the first city? 2) Do they follow the same route?
What disturbs me most is that my results for the Euclidean distance are always smaller than the expected results. With only 11 cities it's feasible to compute all possible routes, I did that for three test-cases and checked the results (shortest Euclidean distance) with Geogebra which confirmed my results.
So obviously I'm missing something important. But would that be?
Any help would be appreciated.
Hi,
Do you consider that it should be a round trip, i.e. that you have to return to the initial city? And the routes can be different for the different distance metrics.
Hi Friend! For loop route starting point doesn't mattter, right?
Each travels his own shortest route. should they be same? probably not always :)
Thanks for the very quick responses.
No, I didn't consider a round trip! And no, I didn't consider different routes either! So that are of course two things I missed. That helps a lot!
Thanks to you both and happy holidays.
Best wishes to you and everyone too! The problem statement is slightly updated now to emphasize these two points - so thanks for raising the questions!
Thanks again for the very quick answers, they really helped a lot. I've solved the problem an hour ago.