Welcome back! We're back in again, with part 3 of 8, the only thing you can change is pressing space to hide the lists or press it again to show them. Don't mind the random misplaced red dot, I have no idea what it is, if you can figure it out, please comment below, and I'll give you credit in my Stem Fair Project and on here! But, why not tell you an abbreviated version of how this works. Essentially, it places 1000 random dots, and divides them into 4 groups, by placing 4 centers randomly and every dot deciding which center it is closest to, and after they have all figured that out, the center moves to the actual center. This is the K-Means part of the algorithm. It then finds the distances between the centers, labeled in distance centers, and the keys at the bottom tell you the points that they are connecting. For example, distance center 1 is from the first point to the second point. And finally, it finds the shortest four distances. It then draws out that path that it has decided is the best. I am doing this whole 8 part series for my Steam fair project, so if you could help, just comment below if you DO NOT see the path in the shape of an actual path that you could travel, a flowing path connecting all four points, please tell me. Thank You!
Huge thanks to Brilliant.org for helping me figure out what the K-means algorithm is. They have been a huge help for me for learning mathematics, science, computer science, and statistics. This is not a sponsored message. Other than their help with understanding and learning about the K-means algorithm, all the code is 100% by me!
