Index

DSA · Intractability: NP-hard

The cliff at n = 11

Ten cities, and you can check every possible route. Eleven, and you cannot. So what do you ship for the eleventh?

A salesman starts at one city, visits the rest once each, and drives home. The map draws the route each method picks, and the slider adds cities. Every city added multiplies the routes. Watch The gap go blank once checking them all is no longer possible.

Board: When Problems Are Hard →

On a narrow screen the map and three readouts stack, and the table scrolls sideways.

try this Set Cities on the map to 10, read The gap, then add one city and watch that number disappear.

Included with a plan

This lab is included with a plan. The first three lessons of every track are free, with their boards and videos. A plan unlocks every lesson, board, video, lab and paper for one price.

View plans →Already a member? Sign in

see also A Framework for Frontier AI and the Dawning of a New Age in Papers.