100. travelling salesman: p vs np problems (ks5)
Dive into theoretical computer science by exploring the Travelling Salesman problem and the limits of modern computation with P vs NP complexity.
Imagine a delivery driver who needs to visit twenty cities and return home via the shortest possible route. Sounds simple? It is actually one of the most famous unsolved problems in mathematics. In this lesson, we will explore the "Travelling Salesman" dilemma. You will dive deep into theoretical computer science, learning about algorithmic time complexity and the fascinating boundary between problems that are easy to verify (NP) and problems that are easy to solve (P).
Last modified: March 26th, 2026
