Have you ever wanted to know more about bรฉzier curves in p5.js? Thanks to a generous donation from Jason Oswald, I do a deep dive exploring the bรฉzier curve function and the math behind the algorithm?
In Part 1 of this multi-part coding challenge, I introduce the classic computer science problem of the Traveling Salesperson (TSP) and discuss the pitfalls with a brute force solution. In Part 2, I discuss Lexicographic Ordering and demonstrate one algorithm to iterate over all the permutations of an array. In Part 3, I apply this algorithm to a brute-force solution of the TSP problem. Every single route permutation is checked one by one. In Part 4, I attempt to create a solution to the TSP problem with a genetic algorithm, and then I add a โcrossoverโ algorithm in Part 5.