Travelling salesperson problem

  • Only connect
    problem

    Only Connect

    Age
    11 to 14
    Challenge level
    The graph represents a salesman’s area of activity with the shops that the salesman must visit each day. What route around the shops has the minimum total distance?
  • Travelling Salesman
    problem

    Travelling Salesman

    Age
    11 to 14
    Challenge level
    A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start. How many Hamiltonian circuits can you find in these graphs?
  • The Olympic Torch Tour
    problem

    The Olympic Torch Tour

    Age
    14 to 16
    Challenge level

    Imagine you had to plan the tour for the Olympic Torch. Is there an efficient way of choosing the shortest possible route?

Displaying 1 - 3 of 3