Difference between revisions of "N-Queens/Sudoku Assignment"

From CSE231 Wiki
Jump to navigation Jump to search
 
(8 intermediate revisions by the same user not shown)
Line 35: Line 35:
 
}</nowiki>
 
}</nowiki>
  
{{CodeToImplement|SequentialNQueens|search|nqueens.lab}}
+
{{CodeToImplement|SequentialNQueens|search|nqueens.warmup}}
  
 
{{Sequential|private static void search(MutableInt count, int[] board, int row)}}
 
{{Sequential|private static void search(MutableInt count, int[] board, int row)}}
Line 47: Line 47:
  
 
There are two constructors for this class.  [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/nqueens/lab/DefaultImmutableQueenLocations.html#DefaultImmutableQueenLocations-int- A public one which creates a fresh new board state with no queens yet placed.] and a private one which creates a new board with the state of a given board which is further constrained by a new queen in the next row.  You need to create a new instance using one of these two constructors.  Which one is it?
 
There are two constructors for this class.  [https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/nqueens/lab/DefaultImmutableQueenLocations.html#DefaultImmutableQueenLocations-int- A public one which creates a fresh new board state with no queens yet placed.] and a private one which creates a new board with the state of a given board which is further constrained by a new queen in the next row.  You need to create a new instance using one of these two constructors.  Which one is it?
 +
 +
Consider this example program which creates a valid 4-queens solution:
 +
 +
<pre> int boardSize = 4;
 +
QueenLocations board0 = new DefaultQueenLocations(boardSize);
 +
QueenLocations board1 = board0.createNext(0, 1);
 +
QueenLocations board2 = board1.createNext(1, 3);
 +
QueenLocations board3 = board2.createNext(2, 0);
 +
QueenLocations board4 = board3.createNext(3, 2);
 +
System.out.println(board4);</pre>
 +
 +
 +
Which board is used to create the next board?
  
 
=====[https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/nqueens/core/ImmutableQueenLocations.html#getBoardSize() getBoardSize()]=====
 
=====[https://www.cse.wustl.edu/~cosgroved/courses/cse231/current/apidocs/nqueens/core/ImmutableQueenLocations.html#getBoardSize() getBoardSize()]=====
Line 199: Line 212:
  
 
==Code To Implement==
 
==Code To Implement==
===DefaultImmutableSudokuPuzzle===
+
===PeerEliminationOnlySudokuPuzzle===
 
As the name suggests, <code>DefaultImmutableSudokuPuzzle</code> is immutable, and you will need to create a new instance of the object whenever you move on from one square to the next. This is analogous to the work you did for [[#NQueens]].
 
As the name suggests, <code>DefaultImmutableSudokuPuzzle</code> is immutable, and you will need to create a new instance of the object whenever you move on from one square to the next. This is analogous to the work you did for [[#NQueens]].
  
{{CodeToImplement|DefaultImmutableSudokuPuzzle|constructors<br>createNext<br>getValue<br>getOptions|sudoku.lab}}
+
{{CodeToImplement|PeerEliminationOnlySudokuPuzzle|constructors<br>createNext<br>getValue<br>getOptions|sudoku.lab}}
  
 
====constructors====
 
====constructors====
DefaultImmutableSudokuPuzzle has two private final fields:
+
The constructors for PeerEliminationOnlySudokuPuzzle have been provided:
 
 
<nowiki> private final ConstraintPropagator constraintPropagator;
 
private final Map<Square, SortedSet<Integer>> candidateSets;</nowiki>
 
 
 
Each will need to be initialized in both of the constructors.
 
  
=====DefaultImmutableSudokuPuzzle(constraintPropagator,givens)=====
+
=====DefaultImmutableSudokuPuzzle(givens)=====
{{Sequential|public DefaultImmutableSudokuPuzzle(ConstraintPropagator constraintPropagator, String givens)}}
+
{{Sequential|public PeerEliminationOnlySudokuPuzzle(String givens)}}
  
 
This constructor creates a puzzle constrained to an initial set of givens.  You can think of the givens as the original values provided by the newspaper or airline magazine or puzzle book or whatever.
 
This constructor creates a puzzle constrained to an initial set of givens.  You can think of the givens as the original values provided by the newspaper or airline magazine or puzzle book or whatever.
  
You will leverage the constraintPropagator to build your map of candidate sets.
+
=====PeerEliminationOnlySudokuPuzzle(other,square,value)=====
 
+
{{Sequential|private PeerEliminationOnlySudokuPuzzle(PeerEliminationOnlySudokuPuzzle other, Square square, int value)}}
=====DefaultImmutableSudokuPuzzle(other,square,value)=====
 
{{Sequential|private DefaultImmutableSudokuPuzzle(DefaultImmutableSudokuPuzzle other, Square square, int value)}}
 
  
This constructor takes a given previous puzzle and a square value to create a new further constrained puzzle.  This will be invoked via a public method on DefaultImmutableSudokuPuzzle during the search process.
+
This constructor takes a given previous puzzle and a square value to create a new further constrained puzzle.  This will be invoked via a public method on PeerEliminationOnlySudokuPuzzle during the search process.
  
 
====createNext(square,value)====
 
====createNext(square,value)====
Line 256: Line 262:
 
{{Warning|Do NOT omit squares with 0 candidates.}}
 
{{Warning|Do NOT omit squares with 0 candidates.}}
  
====RowMajorSquareSearchAlgorithm====
+
====RowMajorSearchOrder====
{{CodeToImplement|RowMajorSquareSearchAlgorithm|selectNextUnfilledSquare|sudoku.lab}}
+
{{CodeToImplement|RowMajorSearchOrder|selectNextUnfilledSquare|sudoku.lab}}
 
{{Sequential|Optional<Square> selectNextUnfilledSquare(ImmutableSudokuPuzzle puzzle)}}
 
{{Sequential|Optional<Square> selectNextUnfilledSquare(ImmutableSudokuPuzzle puzzle)}}
  
Line 264: Line 270:
 
Simply run through the <code>Square.values()</code> which will iterate through squares going down the row (A1, A2, A3, ...). Make sure not to return squares that have already been filled.
 
Simply run through the <code>Square.values()</code> which will iterate through squares going down the row (A1, A2, A3, ...). Make sure not to return squares that have already been filled.
  
====FewestOptionsFirstSquareSearchAlgorithm====
+
====FewestOptionsFirstSearchOrder====
{{CodeToImplement|FewestOptionsFirstSquareSearchAlgorithm|selectNextUnfilledSquare|sudoku.lab}}
+
{{CodeToImplement|FewestOptionsFirstSearchOrder|selectNextUnfilledSquare|sudoku.lab}}
 
{{Sequential|Optional<Square> selectNextUnfilledSquare(ImmutableSudokuPuzzle puzzle)}}
 
{{Sequential|Optional<Square> selectNextUnfilledSquare(ImmutableSudokuPuzzle puzzle)}}
  
Line 284: Line 290:
  
 
{{Parallel|private static void solveKernel(MutableObject<ImmutableSudokuPuzzle> solution, ImmutableSudokuPuzzle puzzle, SquareSearchAlgorithm squareSearchAlgorithm)}}
 
{{Parallel|private static void solveKernel(MutableObject<ImmutableSudokuPuzzle> solution, ImmutableSudokuPuzzle puzzle, SquareSearchAlgorithm squareSearchAlgorithm)}}
 
===(Optional) Advanced Constraint Propagation===
 
====Unit Constraint Propagation====
 
The second rule in [http://norvig.com/sudoku.html Peter Norvig's Essay] is Unit Constraint Propagation: "If a unit has only one possible place for a value, then put the value there". This propagation rule is it bit more challenging to put into code, but doing so can make even the hardest of Sudoku puzzles fall nice and quickly. To complete this bonus part of the lab, simply update your <code>assign</code> and <code>eliminate</code> methods to do unit constraint propagation (don't remove the old propagation rule!). After assigning a square, you'll have to look at the new options set to see if any unit (a single row, column, or box) has only one unassigned square that is a possibility for any value. We encourage you to think of a solution on your own! Below is a example of unit constraint propagation.
 
 
{| class="wikitable"
 
|-
 
! Board !! Info
 
|-
 
| [[File:UnitConstraint1.PNG|200px]]  || We can see that the red square (E1) has only one available option. At this point, let's say we call assign on the red square E1 for the value 6.
 
|-
 
| [[File:UnitConstraint2.PNG|200px]]  || Due to the assignment of red square E1, the value of 6 is eliminated from its peer, yellow square A1.
 
                |-
 
                | [[File:UnitConstraint3.PNG|200px]]  || Our Peer Elimination constraint propagation will treat yellow square A1 as if it has been assigned. Unfortunately, eliminating the value 9 from the peers doesn't open up any new opportunities for solving squares. This is where unit constraint propagation kicks in. Of the three unassigned squares in the top left box unit, 6 is only a valid option in the green square, C3. Even though green square C3 has multiple possible options remaining, we know that it '''must''' be 6, and should assign it as such
 
                |-
 
                | [[File:UnitConstraint4.PNG|200px]]  || Once green square C3 has been assigned (all other options are removed), we should make sure that all of C3's peers have 6 removed from their options. And keep an eye out for any new squares that we now know due to the two propagation rules! With both peer elimination and unit constraint propagation, we can solve a large quantity of Sudoku puzzles without needing any backtracking recursion
 
|}
 
 
====Naked Twins====
 
In what is dubbed a [http://www.sudokudragon.com/sudokustrategy.htm more sophisticated strategy] in [http://norvig.com/sudoku.html Peter Norvig's Essay] is Naked Twins strategy which ''"looks for two squares in the same unit that both have the same two possible digits. Given {'A5': '26', 'A6':'26', ...}, we can conclude that 2 and 6 must be in A5 and A6 (although we don't know which is where), and we can therefore eliminate 2 and 6 from every other square in the A row unit. We could code that strategy in a few lines by adding an elif len(values[s]) == 2 test to eliminate."''
 
 
====Tips====
 
*Make sure your solver uses the generic SquareSearchAlgorithm so that it works with both versions of the search ordering.
 
*Just like n-queens, your <code>solveKernel</code> is the recursive method that will be called in the solve method. Again, watch where you put your <code>finish</code>.
 
*In your <code>solveKernel</code> method, you should use the given search algorithm (row major or fewest options first) to select which square you will fill. After selecting a square, you should recursively call the kernel to check every viable option in the context of the puzzle. If there are no more unfilled squares, you should set the value of the solution to the finished puzzle and exit out of the recursion.
 
  
 
=Testing Your Solution=
 
=Testing Your Solution=
Line 319: Line 300:
 
===Sudoku===
 
===Sudoku===
 
====Propogate====
 
====Propogate====
{{Viz|FxSudokuPropagateApp|sudoku.viz.propogate}}
+
{{Viz|SudokuApp|sudoku.viz.solution}}
  
 
[[File:SudokuPropagateViz.png|600px]]
 
[[File:SudokuPropagateViz.png|600px]]
 +
 
====Solve====
 
====Solve====
 
{{Viz|FxSudokuSolutionApp|sudoku.viz.solution}}
 
{{Viz|FxSudokuSolutionApp|sudoku.viz.solution}}

Latest revision as of 20:11, 4 October 2021

Motivation

Not everything in the world should be divided and conquered. Backtracking is a powerful technique which can be readily parallelized. We will gain experience with backtracking by solving the N-Queens problem and Sudoku in parallel.

N-Queens in particular can be used to explain the call stack as the chessboard *IS* the call stack.

In this assignment, you will implement solutions to both the N-Queens and Sudoku problems.

N-Queens

Example solution of N-Queens when n equals 8

Background

The n-queens problem is a fundamental coding puzzle which asks: how can N queens be placed on an NxN chessboard so that they cannot attack each other? In chess, a queen can attack horizontally, vertically, and diagonally across the board. Thus, to solve the n-queens problem, we must effectively figure out how to place the queens in such a way that no two of them occupy the same row, column, or diagonal. We will be building a method that finds the total number of solutions for n-queens for any given n.

Roadmap to Victory

  1. (Warm Up) SequentialNQueens
  2. DefaultImmutableQueenLocations
  3. FirstAvailableRowSearchAlgorithm
  4. ParallelNQueens

The Core Questions

  • What are the tasks?
  • What is the data?
  • Is the data mutable?
  • If so, how is it shared?

Code To Implement

Sequential Warm Up

	public static int countSolutions(int boardSize) {
		MutableInt count = new MutableInt();
		int[] board = new int[boardSize];
		Arrays.fill(board, EMPTY);
		search(count, board, 0);
		return count.intValue();
	}
class: SequentialNQueens.java Java.png
methods: search
package: nqueens.warmup
source folder: student/src/main/java

method: private static void search(MutableInt count, int[] board, int row) Sequential.svg (sequential implementation only)

Parallel Studio

Board State: DefaultImmutableQueenLocations

class: DefaultQueenLocations.java Java.png
methods: createNext
getBoardSize
getColumnOfQueenInRow
getCandidateColumnsInRow
package: nqueens.lab
source folder: student/src/main/java
createNext(row,col)

method: public DefaultQueenLocations createNext(int row, int col) Sequential.svg (sequential implementation only)

There are two constructors for this class. A public one which creates a fresh new board state with no queens yet placed. and a private one which creates a new board with the state of a given board which is further constrained by a new queen in the next row. You need to create a new instance using one of these two constructors. Which one is it?

Consider this example program which creates a valid 4-queens solution:

		int boardSize = 4;
		QueenLocations board0 = new DefaultQueenLocations(boardSize);
		QueenLocations board1 = board0.createNext(0, 1);
		QueenLocations board2 = board1.createNext(1, 3);
		QueenLocations board3 = board2.createNext(2, 0);
		QueenLocations board4 = board3.createNext(3, 2);
		System.out.println(board4);


Which board is used to create the next board?

getBoardSize()

method: public int getBoardSize() Sequential.svg (sequential implementation only)

Note that we will refer to the standard 8x8 chessboard's size as 8 and not 64.

getColumnOfQueenInRow(row)

method: public Optional<Integer> getColumnOfQueenInRow(int row) Sequential.svg (sequential implementation only)

For an 8x8 board with queens placed in (row=0, col=1), (row=1, col=6), and (row=2, col=4)

Queens in rows 012.png

getCandidateColumnsInRow(row)

method: public List<Integer> getCandidateColumnsInRow(int row) Sequential.svg (sequential implementation only)

For an 8x8 board with a single queen placed in (row=0, col=4)

Queen r0 c4.png

  • getCandidateColumnsInRow(0) returns []
  • getCandidateColumnsInRow(1) returns [0,1,2,6,7]
  • getCandidateColumnsInRow(2) returns [0,1,3,5,7]
  • getCandidateColumnsInRow(3) returns [0,2,3,5,6]
  • getCandidateColumnsInRow(4) returns [1,2,3,5,6,7]
  • getCandidateColumnsInRow(5) returns [0,1,2,3,5,6,7]
  • getCandidateColumnsInRow(6) returns [0,1,2,3,5,6,7]
  • getCandidateColumnsInRow(7) returns [0,1,2,3,5,6,7]

The provided isLocationThreatFree(row, col) method should be helpful.

Search Order: FirstAvailableRowSearchOrder

This class will provide methods that will allow us to implement a clean and efficient parallel solution in the final step.

class: FirstAvailableRowSearchOrder.java Java.png
methods: selectedNextUnplacedRow
package: nqueens.lab
source folder: student/src/main/java

method: public Optional<Integer> selectedNextUnplacedRow(QueenLocations queenLocations) Sequential.svg (sequential implementation only)

For an 8x8 board with queens placed at (row=0, col=0), (row=1, col=3), (row=2, col=6), and (row=6, col=7):

Queen missing in row3.png

  • selectedNextUnplacedRow(queenLocations) returns Optional.of(3)

For a board with no unplaced rows, for example, a solution:

8queens solution0.png


Attention niels epting.svg Warning:Do NOT skip empty rows simply because they have no candidate columns

In cases where a row does not have a queen placed in it, but has no valid candidate columns, for example a 3x3 board with a queen placed at (row=0, col=1):

Queen 3x3 eliminates next row.png

It is critical that

  • selectedNextUnplacedRow(queenLocations) returns Optional.of(1)

When searching for solutions we do not want to avoid dead rows. If anything, we want to move them to the front of the line, so that search can cease the current fruitless path.

ParallelNQueens

Searching for solutions like n-queens can be done in parallel without the need to finish at each level. As such, forasync is preferable to forall. However:

Attention niels epting.svg Warning:Ensure that you complete all of your tasks by enclosing them a single finish.
class: ParallelNQueens.java Java.png
methods: searchForSolutions
countSolutions
package: nqueens.lab
source folder: student/src/main/java

method: public static int countSolutions(QueenLocations queenLocations, RowSearchOrder rowSearchOrder) Parallel.svg (parallel implementation required)

Attention niels epting.svg Warning:FinishAccumulators must be registered with their finish statement

Instead of using a MutableInt in order to count the number of solutions we have found, we want to use a Finish Accumulator.

Creating a new instance of FinishAccumulator is done via on of the many static methods on the V5 class (the same class we get async and finish from).

Refer to the syntax page in order to see the syntax for properly setting up the accumulator.

method: private static void searchForSolutions(FinishAccumulator<Integer> accumulator, QueenLocations queenLocations, RowSearchOrder rowSearchOrder) Parallel.svg (parallel implementation required)


Sudoku

Background

BasicSudoku.PNG

We will be using a similar algorithm to solve a Sudoku puzzle. For those not familiar, a Sudoku puzzle is composed of a 9-by-9 grid of squares. This grid is also divided into 9 large boxes, each of which is a 3-by-3 of the smaller squares. In a completed puzzle, each of the smaller squares contains a single number from 1 to 9 (inclusive). However, if a square contains a given number, that same number cannot be anywhere else in the same row, column, or box. Thus, for Sudoku, we are given an incomplete board and must fill in the remaining squares while meeting these requirements.

Sudoku is another problem well solved by backtracking. Check the understanding you gained of backtracking with N-Queens by challenging yourself to solve Sudoku's solver without assistance. The game of Sudoku is bit more complex though than N-Queens, and there are more strategies we can do than just backtracking in order to speed up our solution. To make this assignment more compelling, you will implement alternate search orderings and constraint propagation.

Read Peter Norvig's Essay before you begin coding. It will cover everything related to the Sudoku problem itself and how one can design a solution for it.

Roadmap to Victory

  1. PeerEliminationOnlySudokuPuzzle
  2. RowMajorSearchOrder
  3. FewestOptionsFirstSearchOrder
  4. ParallelSudoku
  5. (Optional Challenge) Add Unit and Twins Constraint Propagation to DefaultConstraintPropagator

The Core Questions

  • What are the tasks?
  • What is the data?
  • Is the data mutable?
  • If so, how is it shared?

Code To Investigate

Square

enum Square

Collection<Square> getPeers()
valueOf(row, column)
all enums have a values() method

SudokuUtils

class SudokuUtils

deepCopyOf(Map<Square, SortedSet<Integer>> other)
allUnits()
getRowUnit(row)
getColumnUnit(col)
getColumnUnit(row,col)
getUnitsForSquare(square)

CandidateSet

class CandidateSet<E> implements SortedSet<E>

public static CandidateSet createAllCandidates()

Code To Implement

PeerEliminationOnlySudokuPuzzle

As the name suggests, DefaultImmutableSudokuPuzzle is immutable, and you will need to create a new instance of the object whenever you move on from one square to the next. This is analogous to the work you did for #NQueens.

class: PeerEliminationOnlySudokuPuzzle.java Java.png
methods: constructors
createNext
getValue
getOptions
package: sudoku.lab
source folder: student/src/main/java

constructors

The constructors for PeerEliminationOnlySudokuPuzzle have been provided:

DefaultImmutableSudokuPuzzle(givens)

method: public PeerEliminationOnlySudokuPuzzle(String givens) Sequential.svg (sequential implementation only)

This constructor creates a puzzle constrained to an initial set of givens. You can think of the givens as the original values provided by the newspaper or airline magazine or puzzle book or whatever.

PeerEliminationOnlySudokuPuzzle(other,square,value)

method: private PeerEliminationOnlySudokuPuzzle(PeerEliminationOnlySudokuPuzzle other, Square square, int value) Sequential.svg (sequential implementation only)

This constructor takes a given previous puzzle and a square value to create a new further constrained puzzle. This will be invoked via a public method on PeerEliminationOnlySudokuPuzzle during the search process.

createNext(square,value)

method: public ImmutableSudokuPuzzle createNext(Square square, int value) Sequential.svg (sequential implementation only)

This method should create a new puzzle instance using one of the constructors. Which one is it?

getValue(square)

method: public Optional<Integer> getValue(Square square) Sequential.svg (sequential implementation only)

Attention niels epting.svg Warning:Ignore any documentation which reports this method should return 0 if it is unfilled.

Based on the state of the board, return the value of a given square if it is known. Otherwise, return empty.

How do we determine if a value for a given square is "known"?

getCandidates(square)

method: public SortedSet<Integer> getCandidates(Square square) Sequential.svg (sequential implementation only)

Based on the state of the board, return the candidate values for a given square.

Search Order

Simply by changing the search order, a great reduction of work can be achieved.

To implement them, ask yourself:

  • How do I determine if a square is filled?
  • How do I find the unfilled square with the minimum number of candidates?

When you have completed them, ask yourself:

  • Which algorithm will perform better and why?
  • What properties make a square "filled"?
Attention niels epting.svg Warning:Do NOT omit squares with 0 candidates.

RowMajorSearchOrder

class: RowMajorSearchOrder.java Java.png
methods: selectNextUnfilledSquare
package: sudoku.lab
source folder: student/src/main/java

method: Optional<Square> selectNextUnfilledSquare(ImmutableSudokuPuzzle puzzle) Sequential.svg (sequential implementation only)

Attention niels epting.svg Warning:
Ignore any documentation which reports this method should return null if it is completely filled.
This method should return Optional.empty() for a completely filled board.

Simply run through the Square.values() which will iterate through squares going down the row (A1, A2, A3, ...). Make sure not to return squares that have already been filled.

FewestOptionsFirstSearchOrder

class: FewestOptionsFirstSearchOrder.java Java.png
methods: selectNextUnfilledSquare
package: sudoku.lab
source folder: student/src/main/java

method: Optional<Square> selectNextUnfilledSquare(ImmutableSudokuPuzzle puzzle) Sequential.svg (sequential implementation only)

Attention niels epting.svg Warning:
Ignore any documentation which reports this method should return null if it is completely filled.
This method should return Optional.empty() for a completely filled board.

Go through every square by calling Square.values(), find a square that is (1) not already filled, and (2) has the minimal number of possible options among all the squares, and return that square.

Solver

This part of the assignment is also similar to its n-queens counterpart. Searching for solutions like sudoku can be done in parallel without the need to finish at each level. As such, forasync is preferable to forall and is, in fact, required by the test.

Attention niels epting.svg Warning:Ensure that you complete all of your tasks by enclosing them all in a single finish.
Circle-information.svg Tip:Use the iterable version of forasync
class: ParallelSudoku.java Java.png
methods: solve
solveKernel
package: sudoku.lab
source folder: student/src/main/java

method: public static ImmutableSudokuPuzzle solve(ImmutableSudokuPuzzle puzzle, SquareSearchAlgorithm squareSearchAlgorithm) Parallel.svg (parallel implementation required)

method: private static void solveKernel(MutableObject<ImmutableSudokuPuzzle> solution, ImmutableSudokuPuzzle puzzle, SquareSearchAlgorithm squareSearchAlgorithm) Parallel.svg (parallel implementation required)

Testing Your Solution

Visualization

N-Queens

class: NQueensVizApp.java VIZ
package: nqueens.viz.solution
source folder: student/src//java

NQueensViz.png

Sudoku

Propogate

class: SudokuApp.java VIZ
package: sudoku.viz.solution
source folder: student/src//java

SudokuPropagateViz.png

Solve

class: FxSudokuSolutionApp.java VIZ
package: sudoku.viz.solution
source folder: student/src//java

SudokuSolutionViz.png

Correctness

Warm Up

class: SequentialNQueensWarmUpTestSuite.java Junit.png
package: nqueens.warmup
source folder: testing/src/test/java

Lab

There is a top-level test suite comprised of sub test suites which can be invoked separately when you want to focus on one part of the assignment.

class: BacktrackTestSuite.java Junit.png
package: backtrack.lab
source folder: testing/src/test/java

NQueens

class: NQueensTestSuite.java Junit.png
package: nqueens.lab
source folder: testing/src/test/java
ImmutableQueenLocations
class: ImmutableQueenLocationsTestSuite.java Junit.png
package: nqueens.lab
source folder: testing/src/test/java
FirstAvailableRowSearchAlgorithm
class: FirstAvailableRowSearchTestSuite.java Junit.png
package: nqueens.lab
source folder: testing/src/test/java
ParallelNQueens
class: ParallelNQueensSolutionCountTestSuite.java Junit.png
package: nqueens.lab
source folder: testing/src/test/java

Sudoku

class: SudokuTestSuite.java Junit.png
package: sudoku.lab
source folder: testing/src/test/java
DefaultConstraintPropagator
class: DefaultConstraintPropagatorTestSuite.java Junit.png
package: sudoku.lab
source folder: testing/src/test/java
DefaultImmutableSudokuPuzzle
class: DefaultImmutableSudokuPuzzleTestSuite.java Junit.png
package: sudoku.lab
source folder: testing/src/test/java
RowMajorSearchOrder
class: RowMajorSearchOrderTestSuite.java Junit.png
package: sudoku.lab
source folder: testing/src/test/java
FewestOptionsFirstOrder
class: FewestOptionsFirstOrderTestSuite.java Junit.png
package: sudoku.lab
source folder: testing/src/test/java
ParallelSudokuSolve
class: ParallelSudokuSolveTestSuite.java Junit.png
package: sudoku.lab
source folder: testing/src/test/java
Holistic
class: HolisticTestSuite.java Junit.png
package: sudoku.lab
source folder: testing/src/test/java

Extra Credit Challenge Unit Constraint Propagation

class: ChallengeSudokuTestSuite.java Junit.png
package: sudoku.challenge
source folder: testing/src/test/java

Rubric

As always, please make sure to cite your work appropriately.

Total points: 100

N-Queens subtotal: 35

  • Correct DefaultImmutableQueenLocations (10)
  • Correct FirstAvailableRowSearchAlgorithm (5)
  • Correct ParallelNQueens (10)
  • Parallel ParallelNQueens (10)

Sudoku subtotal: 65

  • Correct ImmutableSudokuPuzzle (5)
  • Correct ContraintPropagator (20)
  • Correct RowMajorSearch (10)
  • Correct FewestOptionsFirstSearch (10)
  • Correct ParallelSudoku (10)
  • Parallel ParallelSudoku (10)

Penalties may be assessed for clarity and efficiency.