Suppose that you give a program a partially filled sudoku, you get a completed sudoku.
Can you treat this program as a black box and solve this problem to solve TSP? I mean, is there a way to present the TSP problem as a partially filled sudoku, so if I give you the answer to that sudoku, you can find the polynomial solution for TSP?
