Part 2 – Sudoko The famous Sudoko game is played on a grid of 9 × 9. Each empty square in this grid has to be filled with a number from 1 – 9 without repeating any numbers within the row and column of the square. We will implement a program in C to help us solve a simple 4 x 4 Sudoko puzzle. We will investigate a 4 x 4 Sudoko puzzle, where each row or column is missing 2 numbers only. To fill in a square, if you scan the row (or column) of the square, you will eliminate two out of 4 numbers, and if you then scan the column (or row) of the square, you will eliminate one more number. Thus, you will be left with one missing number in the row and column of the empty square. Thus, you need to fill in the square with this missing number. We are NOT studying the case where scanning the row and column of a square eliminates only 2 numbers. For example, in the following grid, row 0 and column 0 is empty. If we scan row 0, we can eliminate 3 and 4 since they are already there in the row. And if we scan the column, we can additionally eliminate 1. Hence, we can fill the square with 2.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

The code should be in C and not hard-coded. It should use 2D arrays.

Part 2 – Sudoko
The famous Sudoko game is played on a grid of 9 × 9. Each empty square in this grid has to be
filled with a number from 1 – 9 without repeating any numbers within the row and column of the
square. We will implement a program in C to help us solve a simple 4 × 4 Sudoko puzzle. We will
investigate a 4 x 4 Sudoko puzzle, where each row or column is missing 2 numbers only. To fill in
a square, if you scan the row (or column) of the square, you will eliminate two out of 4 numbers,
and if you then scan the column (or row) of the square, you will eliminate one more number. Thus,
you will be left with one missing number in the row and column of the empty square. Thus, you
need to fill in the square with this missing number. We are NOT studying the case where scanning
the row and column of a square eliminates only 2 numbers.
For example, in the following grid, row 0 and column 0 is empty. If we scan row 0, we can eliminate
3 and 4 since they are already there in the row. And if we scan the column, we can additionally
eliminate 1. Hence, we can fill the square with 2.
0 3 4 0
4 0 0 2
1 0 0 3
0 2 1 0
Transcribed Image Text:Part 2 – Sudoko The famous Sudoko game is played on a grid of 9 × 9. Each empty square in this grid has to be filled with a number from 1 – 9 without repeating any numbers within the row and column of the square. We will implement a program in C to help us solve a simple 4 × 4 Sudoko puzzle. We will investigate a 4 x 4 Sudoko puzzle, where each row or column is missing 2 numbers only. To fill in a square, if you scan the row (or column) of the square, you will eliminate two out of 4 numbers, and if you then scan the column (or row) of the square, you will eliminate one more number. Thus, you will be left with one missing number in the row and column of the empty square. Thus, you need to fill in the square with this missing number. We are NOT studying the case where scanning the row and column of a square eliminates only 2 numbers. For example, in the following grid, row 0 and column 0 is empty. If we scan row 0, we can eliminate 3 and 4 since they are already there in the row. And if we scan the column, we can additionally eliminate 1. Hence, we can fill the square with 2. 0 3 4 0 4 0 0 2 1 0 0 3 0 2 1 0
After solving the Sudoko puzzle above, it will look like,
2 3 4 1
413 2
14 2 3
3 21 4
You are required to implement a function that fills in empty squares in the Sudoko grid. The function
prototype is:
void fillSudoko(const int Size, int sudoko[Size][Size]);
Size is a named constant const int Size = 4; and sudoko is the 4 × 4 sudoko grid. You are
encouraged to use other functions. For example, have a function that checks the row of a square and
another to check the column of a square. Although you will only submit your functions, you are
required to implement the whole program on VS Code to test it before submitting.
Hint: When you visit an empty square, you can have a “table" that holds which numbers are found
in the row and column of the square. This will help you know which number is missing.
Transcribed Image Text:After solving the Sudoko puzzle above, it will look like, 2 3 4 1 413 2 14 2 3 3 21 4 You are required to implement a function that fills in empty squares in the Sudoko grid. The function prototype is: void fillSudoko(const int Size, int sudoko[Size][Size]); Size is a named constant const int Size = 4; and sudoko is the 4 × 4 sudoko grid. You are encouraged to use other functions. For example, have a function that checks the row of a square and another to check the column of a square. Although you will only submit your functions, you are required to implement the whole program on VS Code to test it before submitting. Hint: When you visit an empty square, you can have a “table" that holds which numbers are found in the row and column of the square. This will help you know which number is missing.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY