Your task in this exercise is to find the shortest simple cycle that includes all nodes of the graph.
Select the edges that can be a part of the shortest simple cycle.
[TSP_KA.userInput]
if (!TSP_KA.checkAnswer() && !guess[0])
return ""; // User did not click, and correct answer is not
// initial array state
else return TSP_KA.checkAnswer(nnodes);