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

import org.junit.Test;

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);
	}

	@Test(expected = IllegalArgumentException.class)
	public void bruteForceNQueensSolverColumnBitFlagsInvalidTest() {

	}
}

@@ -752,13 +752,83 @@
 st() %7B%0A%0A
+%09%09new BruteForceNQueensSolverColumnBitFlags(Integer.SIZE + 1, false);%0A
 %09%7D%0A%7D%0A

Add test