This optimization problem seeks the shortest round trip visiting every specified city exactly once before returning to the start.

Think it. Then flip it. ahamoraTap to reveal Back to the cue

Math & LogicOne small aha

Your new ahaThe Traveling Salesman Problem

The Traveling Salesman Problem: Asks for the shortest possible route visiting a set of cities. Source: Travelling salesman problem ↗

Keep the thread going

One answer is a beginning.

Share a little curiosity, or follow it into the full collection.

26This reasoning concept, proven unsolvable in general by Alan Turing, asks whether a program will ever finish running.RECALL
The Halting Problem
The halting problem, proven unsolvable in general by Alan Turing, asks whether a program will ever finish running.
Open this card ↗
27This reasoning concept allows degrees of truth beyond strict true or false, used in appliances handling uncertainty.RECALL
Fuzzy Logic
Fuzzy logic allows degrees of truth beyond strict true or false, used in appliances handling uncertainty.
Open this card ↗
28This reasoning concept studies strategic decisions between competing players, applied across economics and political science.RECALL
Game Theory
Game theory studies strategic decisions between competing players, applied across economics and political science.
Open this card ↗