Coding Challenge #35.1: Traveling Salesperson

Coding By Builder

In Part 1 of this multi-part Coding Challenge, I introduce the classic computer science Traveling Salesperson problem (“traveling salesman” (sic) for search) and discussing the pitfalls with a brute force solution.

script type="text/javascript" src="http://aos-creative.prf.hn/creative/camref:100l3Rd/creativeref:10l3694">

Part 1: https://youtu.be/BAejnwN4Ccw
Part 2: https://youtu.be/goUlyp4rwiU
Part 3: https://youtu.be/9Xy-LMAfglE
Part 4: https://youtu.be/M3KTWnTrU_c
Part 5: https://youtu.be/hnxn6DtLYcY

Support this channel on Patreon: https://patreon.com/codingtrain

Send me your questions and coding challenges!: https://github.com/CodingTrain/Rainbow-Topics

Contact: https://twitter.com/shiffman

Links discussed in this video:
MDN Array Reference: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array
Traveling Salesman on Wikipedia: https://en.wikipedia.org/wiki/Travelling_salesman_problem

Source Code for the Video Lessons: https://github.com/CodingTrain/Rainbow-Code

p5.js: https://p5js.org/
Processing: https://processing.org

For More Coding Challenges: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH

Help us caption & translate this video!

http://amara.org/v/UyoS/

source