 # For this assignment, you are to design and implement a Java program...

## Question

Show transcribed text

## Transcribed Text

For this assignment, you are to design and implement a Java program for solving KenKen puzzles. The class should be named KenKen. The file should be KenKen.java. If you are not familiar with KenKen, it is played on an NxN puzzle grid in which the numbers 1 through N are placed. To complete a puzzle, the player must fill in the grid such that the numbers 1 through N appear in every row and column. Furthermore, sets of outlined squares (called cages) have mathematical constraints. For example, the top left square in the above puzzle is in a cage with the constraint "16x," which means that the three numbers in the cage have a product of 16 (i.e., 4*2*2 or 4*4*1). For a person, solving a KenKen puzzle requires complex and careful logical reasoning. Try so solve a few puzzles on the web. KenKen puzzles can be easily solved by a computer using depth first search with recursive backtracking. Your program should prompt the user for a file that contains the specifications for a puzzle. The first line of the puzzle file should specify the size of the puzzle (you may assume a maximum size of 9x9). Each subsequent line should identify a cage, with the constraint first (e.g., "16*") followed by the coordinates in the cage. For example, the above puzzle would be represented as: 4 16 * 0 0 0 1 1 1 7 + 0 2 0 3 1 2 2 - 1 0 2 0 4 # 1 3 12 * 2 1 3 0 3 1 2 / 2 2 2 3 2 / 3 2 3 3 Notes:  To make things easier to parse, the cells appear as pairs of numbers separated by whitespace. Thus, the line 16 * 0 0 0 1 1 1 states that the cells (0,0) (0,1) and (1,1) multiply to be 16.  '-' and '/' constraints always contain exactly two points  We use the '#' to represent no-op. No-ops constraints always contain exactly one cell. Your program should display the solved puzzle if a solution exists, or display a message if no solution is possible. The solution to the above puzzle is:

## Solution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

import java.util.*;
import java.io.*;

/**
* A class that represents a coordinate in a grid.
* @params row an integer that denotes the row index
* @params column an integer that deontes the column index
*/
class Coordinate {
private int row;
private int column;

public Coordinate(int row, int column) {
this.row = row;
this.column = column;
}

public int getRow() { return this.row; }
public int getColumn() { return this.column; }
}

/**
* A class that represents a constraint in the KenKen puzzle
* @params goal an integer that represents the aggregate value of a "cage"
*/
class Constraint {
protected int goal;

//coordinates is used to keep the coordinate that is enclosed by the "cage".
protected List<Coordinate> coordinates;

public Constraint(int goal) {
this.goal = goal;
this.coordinates = new ArrayList<Coordinate>();
}

//Add a coordinate to our "cage".
}

public boolean evaluate(int[][] numbers) {
return true;
}
}

/**
* A class that represents a multiplication constraint in KenKen puzzle
* @params goal an integer that represents the multiplication of values in a "cage"
*/
class MultiplicationConstraint extends Constraint {
public MultiplicationConstraint(int goal) {
super(goal);
}...

By purchasing this solution you'll be able to access the following files:
Solution.java.

\$95.00
for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

### Find A Tutor

View available Java Programming Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.