i have write sml code solve knight's tour problem in backtracking. chess knight must run on chessboard (size: nxn ) , must visit each square once (no need come in first square @ end). i write functions create empty board, set or squares in board, list of possible knight next moves. have no idea on how write recursive function in sml (i know how write algorithm in c not in sml). algorithm in c 8x8 chessboard dl , dr array : (delta calculate next moves) dl = [-2,-2, -1, 1, 2, 2, 1, -1] dr = [-1, 1, 2, 2, 1, -1,-2, -2] bool backtracking(int** board, int k/*current step*/, int line, int row, int* dl, int* dr) { bool success = false; int way = 0; do{ way++; int new_line = line + dl[way]; int new_row = row + dr[way]; if(legal_move(board, new_line, new_row)) { setboard(board,new_line, new_row,k); //write current step number k in board if(k<64) { success = backt...