/**
 * Copyright (c) 2015, Ecole des Mines de Nantes
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    This product includes software developed by the <organization>.
 * 4. Neither the name of the <organization> nor the
 *    names of its contributors may be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY <COPYRIGHT HOLDER> ''AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package org.chocosolver.samples.todo.problems.nqueen;

import org.chocosolver.solver.Model;
import org.chocosolver.solver.constraints.Constraint;
import org.chocosolver.solver.variables.IntVar;

import java.util.HashSet;
import java.util.stream.IntStream;

import static org.chocosolver.solver.search.strategy.SearchStrategyFactory.minDomLBSearch;

/**
 * <br/>
 *
 * @author Charles Prud'homme
 * @since 31/03/11
 */
public class NQueenBinary extends AbstractNQueen {

    HashSet<Constraint> set;

    @Override
    public void buildModel() {
        model = new Model("NQueen");
        vars = model.intVarArray("Q", n, 1, n);
        IntStream.range(0, n-1).forEach(i ->
                IntStream.range(i+1, n).forEach(j ->{
                    IntVar k = model.intVar(j - i);
                    vars[i].ne(vars[j]).post();
                    vars[i].ne(vars[j].sub(k)).post();
                    vars[i].ne(vars[j].add(k)).post();
                })
        );
        model.solve();
    }



    @Override
    public void configureSearch() {
        System.out.printf("%s\n", model);
        model.getSolver().showDecisions();
        model.getSolver().showSolutions();
        model.getSolver().set(minDomLBSearch(vars));
//        SearchMonitorFactory.log(solver, true, false);
    }

    public static void main(String[] args) {
        new NQueenBinary().execute(args);
    }
}

@@ -1886,56 +1886,8 @@
 int;
-%0Aimport org.chocosolver.solver.variables.IntVar;
 %0A%0Aim
@@ -2422,60 +2422,8 @@
 -%3E%7B%0A
-                    IntVar k = model.intVar(j - i);%0A
     
@@ -2509,17 +2509,21 @@
 %5Bj%5D.sub(
-k
+j - i
 )).post(
@@ -2568,17 +2568,21 @@
 %5Bj%5D.add(
-k
+j - i
 )).post(

update n-queen pb