These kind of video are actual motivation to get into the stuff

0:17 trivial*

best visualization I've seen on TSP

How difficult is it to draw a circle?

Good visualization of the salesman problem. Thanks!

teacher I developed a heuristic and would like to share it. My heuristic uses topology and concentric circles. What do you think?.

I agree with the others...I'm a techie and route planning solver...this helps me when explaining to customers

One of the sub problems that i had in my dimploma project duting my bacholer's involed this problem. I solved it using two methods: integer programming and genetic algorithms. It was so fun and exciting. I'm so eager to learn more math during my master's.

0:05 why wouldn't it be 8!?

lol I can literally just watch this for the music. Mmy favourite part starts at 1:43, watched for 4 times.

Absolutely love the aesthetic of the video !

If you ever played Galactic Civilizations 3, you have to deal with this problem too when you start to set up your Hypergate networks. Thanks for the suggestions about moving the edges. That will help!

insanely underrated!

fortnite

Wow! This is impressive work. I need to make one now.

that is fantastic. well done.

This is so cool ! Always loved the whole PS/2 series aesthetic back then, and still today. So refreshing. And really enjoyed that old-school "text mode" font in the video !

Do we need this to show us how to travel in a circle? They created the problem first to justify an answer.

An idea I had for the travelling salesman problem (when the points are in some euclidean space): 1) Enclose the smallest possible convex hull around all of the points. 2) For each point not on the edge of the current hull, pick the one that is closest to the hull (or, that would increase the length of the path the least if inserted into the closest hull edge). 3) Bend the hull to include that point. The point would be inserted between the two points already in the hull forming the edge that it is closest to. 4) Go to step 2 until there are no points left not part of the hull. For added precision, you could enumerate through all of the first N possible vertex insertions and use the combination of insertions that results in the shortest path. The above algorithm assumes N == 1. I just tried doing this manually in MS Paint and it seems to work pretty well. I got almost the same result you did at 1:17 (though I did eyeball it).

How did you make this video

It's beautiful, but please don't change the number of vertices from one demonstration to the next. This confuses the viewer as to whether the final result is truly optimal. I thought the last result is sub-optimal, because it didn't look like the one you showed previously, which was actually for a smaller number of cities.

More videos pls

Love it! These are the types of visualizations we need to get people into mathematics. So much easier to understand than a dude at a white board

Guys, I think I found the solution to reduce the time as much as possible. But what can I do with the solution?

Ill use it to visit US thank you

Deeeeeeeeeeeeeeeem

Not trying to sound like a dick... but this was really a legit problem 30-40 years ago? Wow we actually are getting smarter wtf 👍

I can't believe my ears! Is this post rock music in an algorithm video I hear? Had to watch multiple times. It made my day! Now if only every piece of information was accessible through a video like this. :/

this is n sane

DOWNLOAD Grokking Algorithms FREE PDF oke.io/Ok2t

I always come back to this video due to the sheer amount of beauty it contains.

Your "greedy algorithm" doesn't choose the nearest city as claimed 00:16

Fantastic.

Can I get the source code

welp rikei ga koi piqued my interest to here

Awesome work! Thank you.

Wow, it's so intense and difficult that there had to be epic music to accompany it

I Luv the channel name

very cool video on travelling salesman problem. Interesting visualization.

Thanks! Really appreciate your work! May I cite your work in my presentation? Please let me know how can I properly cite it!

how were you able to make the simulation? can you tell us what software/application you have used for the same?

well that was pretty fucking cool

I thought these were bus routes.......

In what computer science course do we learn about the Traveling Salesman Problem, the Post Correspondence Problem, etc..?

I like shrinking blob.

nice

More visualising algorithms videos please :) How about 2D sorts, these are on a 2D grid and the numbers must decrease downwards as well as rightwards.

How did you get the visual representation?

Love the visualization

I watched this 2 or 3 years ago. Now, I am here again. Great video! Visualization and your choice of music make me watch this over and over again.