Write a program in c++ to generate a solution to the Sudoku game using the local search for CSP. The objective is to fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 sub-grids that compose the grid contain all of the digits from 1 to 9. Your program should print the output like the following example: Use the operation of swapping two random numbers to be your action of generating a child for the current node. Your program should start by generating a random 9x9 square (note that each number should appear 9 times) and then start improving on this state until reaching a goal by the guidance of the fitness function. If your code doesn’t reach a solution after 10 seconds then print out the reached state anyway.
Write a program in c++ to generate a solution to the Sudoku game using the local search for CSP. The objective is to fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 sub-grids that compose the grid contain all of the digits from 1 to 9. Your program should print the output like the following example:
Use the operation of swapping two random numbers to be your action of generating a child for the current node. Your program should start by generating a random 9x9 square (note that each number should appear 9 times) and then start improving on this state until reaching a goal by the guidance of the fitness function. If your code doesn’t reach a solution after 10 seconds then print out the reached state anyway.
Step by step
Solved in 2 steps with 1 images
I want this code using local search not backtracking!
by Bartleby ExpertCan you explain every line in code in comments And why solve in this way?
by Bartleby Expert
