Travelling Salesman in a Grid

  • + 1 comment

    If we have only one line (or equaly column) of length >= 3 - there is no way of traveling through all cells and get back visiting each cell only once. What should be an answer in this case?