Answer to Question #169835 in C++ for sara

Question

In a 2x2 Sudoku puzzle, there are 4 connected 2x2 grids and the objective is to fill the grid with

numbers from the set V = {1, 2, 3, 4}, such that each number appears exactly once in the same grid,

exactly once in any row, and exactly once in any column. Below is a diagram depicting an empty

2x2 Sudoku and a possible solution state.

Write a program that takes an empty 2x2 grid as input and fills it to reach a valid solution state using

backtracking.

Answer 1

Dear sara, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order