Sudoku puzzle Program plan: Include required header files. Define the “SudokuPuzzle” class. Declare the two-dimensional array variables. In the SudokuPuzzle() constructor, Create objects of SudokoPuzzle class. Define the main() method. Create an object for Scanner class. Create an object for SudokoPuzzle class. Call initializePuzzle() method to initialize the puzzle. Display the puzzle values. The while loop executes until the true. If yes, Check whether the input is “q”. If yes, exit the program. Otherwise, check whether the input is “s”. If yes, set the guess value. Otherwise, check whether the input is “g”. If yes, get the allowed values. Otherwise, check whether the input is “c”. If yes, clear the puzzles. Check whether the puzzle value is not valid. If yes, display the error message. Otherwise, check whether the puzzle is full. If yes, display the success message. In the toString() method, Return the puzzle representation. In the addInitial() method, Check whether row and col is in between “0” to “9” and value is in between “1” to “9”. If yes, Set the puzzle values and the square value cannot be changed by puzzle solver. In the addGuess() method, Check whether row and col is in between “0” to “9” and value is in between “1” to “9” and start puzzle with “0”. If yes, set the guess value to puzzle. In the getValueIn() method, Return the value in given square. In the reset() method, Reset the puzzle value to blank. In the isFull() method, Check whether the puzzle is full and then set the flag value as “true”. In the getAllowedValues() method, Display the allowed values for puzzles. In the checkPuzzle() method, Check whether the values in the squares are legal. If yes, return true. In the checkRow() method, Check whether value is appears only once in row. If yes, return true. In the checkCol() method, Check whether value is appears only once in col. If yes, return true. In the checkSub() method, Check whether value is appears only once in 3 by 3 sub-array. If yes, return true. In the initializePuzzle() method, Call addInitial() method to initialize the puzzle to the board configuration example in the text.

Question

Want to see the full answer?

Answer 1

Question

Chapter 7, Problem 11PP

Program Plan Intro

Sudoku puzzle

Program plan:

Include required header files.

Define the “SudokuPuzzle” class.

Declare the two-dimensional array variables.

In the SudokuPuzzle() constructor,

Create objects of SudokoPuzzle class.

Define the main() method.

Create an object for Scanner class.

Create an object for SudokoPuzzle class.

Call initializePuzzle() method to initialize the puzzle.

Display the puzzle values.

The while loop executes until the true. If yes,

Check whether the input is “q”. If yes, exit the program.

Otherwise, check whether the input is “s”. If yes, set the guess value.

Otherwise, check whether the input is “g”. If yes, get the allowed values.

Otherwise, check whether the input is “c”. If yes, clear the puzzles.

Check whether the puzzle value is not valid. If yes, display the error message.

Otherwise, check whether the puzzle is full. If yes, display the success message.

In the toString() method,

Return the puzzle representation.

In the addInitial() method,

Check whether row and col is in between “0” to “9” and value is in between “1” to “9”. If yes,

Set the puzzle values and the square value cannot be changed by puzzle solver.

In the addGuess() method,

Check whether row and col is in between “0” to “9” and value is in between “1” to “9” and start puzzle with “0”. If yes, set the guess value to puzzle.

In the getValueIn() method,

Return the value in given square.

In the reset() method,

Reset the puzzle value to blank.

In the isFull() method,

Check whether the puzzle is full and then set the flag value as “true”.

In the getAllowedValues() method,

Display the allowed values for puzzles.

In the checkPuzzle() method,

Check whether the values in the squares are legal. If yes, return true.

In the checkRow() method,

Check whether value is appears only once in row. If yes, return true.

In the checkCol() method,

Check whether value is appears only once in col. If yes, return true.

In the checkSub() method,

Check whether value is appears only once in 3 by 3 sub-array. If yes, return true.

In the initializePuzzle() method,

Call addInitial() method to initialize the puzzle to the board configuration example in the text.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…

using r language

I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…