C++ Multithread -- Sudoku Validator

Project 1-Sudoku Solution Validator A Sudoku puzzle uses a 9 x 9 grid in which each column and row, as well as each of the nine 3 x 3 subgrids, must contain all of the digits 1..9. Figure 4.19 presents an example of a valid Sudoku puzzle. This project consists of designing a multithreaded application that determines whether the solution to a Sudoku puzzle is valid There are several different ways of multithreading this application. One suggested strategy is to create threads that check the following criteria A thread to check that each column contains the digits 1 through 9 A thread to check that each row contains the digits 1 through 9 Nine threads to check that each of the 3 3 subgrids contains the digits 1 through 9 rate threads for validating a Sudoku puzzle. However, you are welcome to create even more threads for this project. For example, rather than creating one thread that checks all nine This would result in a total of eleven 6 2 45 3 91 87 5 1 972 86 34 8 37 6 1 4 29 5 1 4 3 8 6 5 7 2 9 9 58 2 4 7 3 6 1 7 62 3 9 1 4 5 8 3 7 1 9 5 68 42 4 9 68 2 5 7 3 2 85 4 7 3 9 1 6 Figure 4.19 Solution to a 9 x 9 Sudoku puzzle columns, you could create nine sepa one column. rate threads and have each of them check