In the Knight's Tour exercise, Warnsdorff made an improvement to the algorithm. Describe the key idea of what makes his

algorithm work better than the original.

fun $(4,3)$

int fun$($int $x,$ int $y)$

$\{$

if $(x==0)$

return $y$;

return fun $(x-1,x+y)$

$\}$

Select one

A$.$ Choose the next square for the knight where the most neighboring squares have already been visited.

B$.$ Start in the corner of the board first.

C$.$ Choose the next square for the knight in the upper$-$left area first.

D$.$ Backtrack only when a dead$-$end has been reached.