package com.github.sbugat.nqueens.solvers.bruteforce;

import com.github.sbugat.nqueens.GenericNQueensSolverTemplateTest;

/**
 * Brute-force N queens solver test.
 * 
 * @author Sylvain Bugat
 * 
 */
public final class BruteForceNQueensSolverColumnBitFlagsTest extends GenericNQueensSolverTemplateTest {

	/** Test only with a size of 6 because this algorithm is slow. */
	private static final int MAXIMUM_TESTED_CHESSBOARD_SIZE = 7;

	public BruteForceNQueensSolverColumnBitFlagsTest() {

		super(new BruteForceNQueensSolverColumnBitFlags(MAXIMUM_TESTED_CHESSBOARD_SIZE, false), MAXIMUM_TESTED_CHESSBOARD_SIZE);
	}
}

@@ -48,16 +48,40 @@
 force;%0A%0A
+import org.junit.Test;%0A%0A
 import c
@@ -633,11 +633,132 @@
 IZE);%0A%09%7D
+%0A%0A%09@Test(expected = IllegalArgumentException.class)%0A%09public void bruteForceNQueensSolverColumnBitFlagsInvalidTest() %7B%0A%0A%09%7D
 %0A%7D%0A

Add test