Challenges

Featured Challenge:
#176 — Buffon's Needle

How do toothpicks approximate the value of pi? I'll show you by coding a simulation in p5.js!

mar 14, 2023

Buffon's Needle

Filter by Language

Pick a language to filter

Filter by Topic

permutation

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.

Traveling Salesperson