Home
last modified time | relevance | path

Searched refs:queens (Results 1 – 25 of 823) sorted by relevance

12345678910>>...33

/dports/math/py-or-tools/or-tools-9.2/examples/flatzinc/
H A Dqueens3.fzn70 constraint int_ne(queens[1], queens[2]);
71 constraint int_ne(queens[1], queens[3]);
72 constraint int_ne(queens[1], queens[4]);
73 constraint int_ne(queens[1], queens[5]);
74 constraint int_ne(queens[1], queens[6]);
75 constraint int_ne(queens[1], queens[7]);
76 constraint int_ne(queens[1], queens[8]);
77 constraint int_ne(queens[2], queens[3]);
78 constraint int_ne(queens[2], queens[4]);
79 constraint int_ne(queens[2], queens[5]);
[all …]
H A Dqueens_viz.fzn69 constraint int_ne(queens[1], queens[2]);
70 constraint int_ne(queens[1], queens[3]);
71 constraint int_ne(queens[1], queens[4]);
72 constraint int_ne(queens[1], queens[5]);
73 constraint int_ne(queens[1], queens[6]);
74 constraint int_ne(queens[1], queens[7]);
75 constraint int_ne(queens[1], queens[8]);
76 constraint int_ne(queens[2], queens[3]);
77 constraint int_ne(queens[2], queens[4]);
78 constraint int_ne(queens[2], queens[5]);
[all …]
H A Dqueens4.fzn36 array [1..12] of var 1..12: queens :: output_array([1..12]);
39 constraint fzn_all_different_int(queens);
40 constraint int_lin_eq([-1, 1], [INT____00001, queens[1]], 1) :: defines_var(INT____00001) :: domain;
41 constraint int_lin_eq([-1, 1], [INT____00002, queens[2]], 2) :: defines_var(INT____00002) :: domain;
42 constraint int_lin_eq([-1, 1], [INT____00003, queens[3]], 3) :: defines_var(INT____00003) :: domain;
43 constraint int_lin_eq([-1, 1], [INT____00004, queens[4]], 4) :: defines_var(INT____00004) :: domain;
44 constraint int_lin_eq([-1, 1], [INT____00005, queens[5]], 5) :: defines_var(INT____00005) :: domain;
45 constraint int_lin_eq([-1, 1], [INT____00006, queens[6]], 6) :: defines_var(INT____00006) :: domain;
46 constraint int_lin_eq([-1, 1], [INT____00007, queens[7]], 7) :: defines_var(INT____00007) :: domain;
47 constraint int_lin_eq([-1, 1], [INT____00008, queens[8]], 8) :: defines_var(INT____00008) :: domain;
[all …]
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/examples/fd/
H A DQueens.java83 IntVar queens[] = new IntVar[numberQ]; in modelBasic() local
89 vars.add(queens[i]); in modelBasic()
94 for (int i = 0; i < queens.length; i++) in modelBasic()
96 store.impose(new XneqY(queens[i], queens[j])); in modelBasic()
99 for (int i = 0; i < queens.length; i++) in modelBasic()
137 IntVar queens[] = new IntVar[numberQ]; in modelChanneling() local
141 vars.add(queens[i]); in modelChanneling()
144 store.impose(new Alldiff(queens)); in modelChanneling()
193 IntVar queens[] = new IntVar[numberQ]; in model() local
197 vars.add(queens[i]); in model()
[all …]
/dports/math/py-mip/mip-1.13.0/bench/
H A Dbench.sh3 rm -f queens-mip-cbc-cpython.csv queens-mip-cbc-pypy.csv queens-mip-grb-cpython.csv \
7 python3 queens.py cbc
8 mv queens-mip-cbc.csv queens-mip-cbc-cpython.csv
12 mv queens-mip-gurobi.csv queens-mip-grb-cpython.csv
15 pypy3 queens.py cbc
16 mv queens-mip-cbc.csv queens-mip-cbc-pypy.csv
19 pypy3 queens.py gurobi
20 mv queens-mip-gurobi.csv queens-mip-grb-pypy.csv
27 mv queens-pulp.csv queens-pulp-cpython.csv
30 pypy3 queens-pulp.py
[all …]
H A Dqueens.py30 queens = Model("queens", solver_name=solver)
34 queens.add_var("x({},{})".format(i, j), var_type="B", obj=-1.0)
42 queens.add_constr(
48 queens.add_constr(
54 queens.add_constr(
62 queens.add_constr(
70 modelCols = queens.num_cols
71 modelRows = queens.num_rows
72 modelNz = queens.num_nz
H A Dqueens-gurobi.py28 queens = Model('queens')
30 x = [[queens.addVar(name='x({},{})'.format(i, j), vtype='B', obj=-1)
35 queens.addConstr(quicksum(x[i][j] for j in range(n)) == 1,
40 queens.addConstr(quicksum(x[i][j] for i in range(n)) == 1,
45 queens.addConstr(quicksum(x[i][j] for i in range(n) for j in range(n)
50 queens.addConstr(quicksum(x[i][j] for i in range(n) for j in range(n)
56 modelCols = queens.NumVars
57 modelRows = queens.NumConstrs
H A Dqueens-pulp.py29 queens = LpProblem('queens', LpMinimize)
36 queens += lpSum(x[i][j] for j in range(n)) == 1, 'row({})'.format(i)
40 queens += lpSum(x[i][j] for i in range(n)) == 1, 'col({})'.format(j)
44 queens += lpSum(x[i][j] for i in range(n) for j in range(n)
49 queens += lpSum(x[i][j] for i in range(n) for j in range(n)
54 modelCols = queens.numVariables()
55 modelRows = queens.numConstraints()
/dports/math/py-or-tools/or-tools-9.2/ortools/sat/samples/
H A DNQueensSat.java31 queens = queensIn; in SolutionPrinter()
37 for (int i = 0; i < queens.length; ++i) { in onSolutionCallback()
38 for (int j = 0; j < queens.length; ++j) { in onSolutionCallback()
39 if (value(queens[j]) == i) { in onSolutionCallback()
44 if (j != queens.length - 1) { in onSolutionCallback()
58 private final IntVar[] queens; field in NQueensSat.SolutionPrinter
71 IntVar[] queens = new IntVar[boardSize]; in main() local
73 queens[i] = model.newIntVar(0, boardSize - 1, "x" + i); in main()
80 model.addAllDifferent(queens); in main()
87 diag1[i] = LinearExpr.affine(queens[i], /*coefficient=*/1, /*offset=*/i); in main()
[all …]
H A DNQueensSat.cs26 public SolutionPrinter(IntVar[] queens) in SolutionPrinter() argument
28 queens_ = queens; in SolutionPrinter()
73 IntVar[] queens = new IntVar[BoardSize]; in Main()
76 queens[i] = model.NewIntVar(0, BoardSize - 1, $"x{i}"); in Main()
83 model.AddAllDifferent(queens); in Main()
91 diag1[i] = LinearExpr.Affine(queens[i], /*coeff=*/1, /*offset=*/i); in Main()
92 diag2[i] = LinearExpr.Affine(queens[i], /*coeff=*/1, /*offset=*/-i); in Main()
102 SolutionPrinter cb = new SolutionPrinter(queens); in Main()
H A Dnqueens_sat.py27 def __init__(self, queens): argument
29 self.__queens = queens
65 queens = [
73 model.AddAllDifferent(queens)
79 model.AddAllDifferent([queens[i] + i for i in range(board_size)])
80 model.AddAllDifferent([queens[i] - i for i in range(board_size)])
86 solution_printer = NQueenSolutionPrinter(queens)
H A Dnqueens_sat.cc36 std::vector<IntVar> queens; in NQueensSat() local
37 queens.reserve(board_size); in NQueensSat()
40 queens.push_back( in NQueensSat()
48 cp_model.AddAllDifferent(queens); in NQueensSat()
57 diag_1.push_back(queens[i] + i); in NQueensSat()
58 diag_2.push_back(queens[i] - i); in NQueensSat()
72 if (SolutionIntegerValue(response, queens[j]) == i) { in NQueensSat()
/dports/math/z3/z3-z3-4.8.13/examples/userPropagator/
H A Dexample.cpp184 std::vector<z3::expr> queens; in createQueens() local
189 return queens; in createQueens()
193 for (unsigned i = 0; i < queens.size(); i++) { in createConstraints()
195 solver.add(z3::uge(queens[i], 0)); in createConstraints()
196 solver.add(z3::ule(queens[i], (int) (queens.size() - 1))); in createConstraints()
200 for (const z3::expr &queen : queens) { in createConstraints()
207 for (unsigned i = 0; i < queens.size(); i++) { in createConstraints()
209 solver.add((int)(j - i) != (queens[j] - queens[i])); in createConstraints()
210 solver.add((int)(j - i) != (queens[i] - queens[j])); in createConstraints()
222 createConstraints(context, solver, queens); in test01()
[all …]
/dports/math/minizinc/libminizinc-2.5.5/tests/spec/unit/regression/
H A Dbug269.mzn6 queens: [4, 6, 1, 5, 2, 8, 3, 7]
9 queens: [4, 6, 8, 3, 1, 7, 5, 2]
12 queens: [8, 4, 1, 3, 6, 2, 7, 5]
15 queens: [2, 5, 7, 4, 1, 8, 6, 3]
24 array[1..n] of var 1..n: queens;
28 queens,
34 constraint all_different(queens);
35 constraint all_different([queens[i]+i | i in 1..n]);
36 constraint all_different([queens[i]-i | i in 1..n]);
/dports/math/minizinc/libminizinc-2.5.5/docs/en/
H A Djupyter.rst38 array[1..n] of var 1..n: queens;
39 constraint all_different(queens);
59 array[1..n] of var 1..n: queens;
60 constraint all_different(queens);
65 In[4]: queens
81 array[1..n] of var 1..n: queens;
82 constraint all_different(queens);
87 Out[3]: [{u'queens': [5, 3, 1, 6, 4, 2]},
88 {u'queens': [4, 1, 5, 2, 6, 3]},
89 {u'queens': [3, 6, 2, 5, 1, 4]},
[all …]
/dports/math/py-mip/mip-1.13.0/examples/
H A Dqueens.py11 queens = Model() variable
13 x = [[queens.add_var('x({},{})'.format(i, j), var_type=BINARY)
18 queens += xsum(x[i][j] for j in range(n)) == 1, 'row({})'.format(i)
22 queens += xsum(x[i][j] for i in range(n)) == 1, 'col({})'.format(j)
26 queens += xsum(x[i][i - k] for i in range(n)
31 queens += xsum(x[i][k - i] for i in range(n)
34 queens.optimize()
36 if queens.num_solutions:
38 for i, v in enumerate(queens.vars):
/dports/textproc/kf5-syntax-highlighting/syntax-highlighting-5.89.0/autotests/input/
H A Dhighlight.exu24 -- do two queens threaten each other?
40 for i = 1 to length(queens) do
41 if threat(q, queens[i]) then
51 procedure print_board(sequence queens)
63 if find({r,c}, queens) then
82 procedure place_queen(sequence queens)
83 -- place queens on a NxN chess board
86 if length(queens) = N then
88 print_board(queens)
91 r = length(queens)+1
[all …]
/dports/textproc/p5-Syntax-Highlight-Engine-Kate/Syntax-Highlight-Engine-Kate-0.14/samples/
H A Dhighlight.exu24 -- do two queens threaten each other?
40 for i = 1 to length(queens) do
41 if threat(q, queens[i]) then
51 procedure print_board(sequence queens)
63 if find({r,c}, queens) then
82 procedure place_queen(sequence queens)
83 -- place queens on a NxN chess board
86 if length(queens) = N then
88 print_board(queens)
91 r = length(queens)+1
[all …]
/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/samples/
H A Dnqueens_cp.cc34 std::vector<IntVar*> queens; in NQueensCp() local
35 queens.reserve(board_size); in NQueensCp()
37 queens.push_back(solver.MakeIntVar(0, board_size - 1, absl::StrCat("x",i))); in NQueensCp()
44 solver.AddConstraint(solver.MakeAllDifferent(queens)); in NQueensCp()
53 diag_1.push_back(solver.MakeSum(queens[i], i)->Var()); in NQueensCp()
54 diag_2.push_back(solver.MakeSum(queens[i], -i)->Var()); in NQueensCp()
62 queens, Solver::CHOOSE_FIRST_UNBOUND, Solver::ASSIGN_MIN_VALUE); in NQueensCp()
76 if (queens[j]->Value() == i) { in NQueensCp()
H A DNQueensCp.cs32 IntVar[] queens = new IntVar[BoardSize]; in Main()
35 queens[i] = solver.MakeIntVar(0, BoardSize - 1, $"x{i}"); in Main()
42 solver.Add(queens.AllDifferent()); in Main()
50 diag1[i] = solver.MakeSum(queens[i], i).Var(); in Main()
51 diag2[i] = solver.MakeSum(queens[i], -i).Var(); in Main()
60 …DecisionBuilder db = solver.MakePhase(queens, Solver.CHOOSE_FIRST_UNBOUND, Solver.ASSIGN_MIN_VALUE… in Main()
74 if (queens[j].Value() == i) in Main()
H A Dnqueens_cp.py31 queens = [
39 solver.Add(solver.AllDifferent(queens))
42 solver.Add(solver.AllDifferent([queens[i] + i for i in range(board_size)]))
43 solver.Add(solver.AllDifferent([queens[i] - i for i in range(board_size)]))
47 db = solver.Phase(queens, solver.CHOOSE_FIRST_UNBOUND,
59 if queens[j].Value() == i:
/dports/textproc/kf5-syntax-highlighting/syntax-highlighting-5.89.0/autotests/folding/
H A Dhighlight.exu.fold24 -- do two queens threaten each other?
39 -- Would square p cause a conflict with other queens on board so far?
40 <beginfold id='5'>for</beginfold id='5'> i = 1 to length(queens) do
41 <beginfold id='4'>if</beginfold id='4'> threat(q, queens[i]) then
63 <beginfold id='4'>if</beginfold id='4'> find({r,c}, queens) then
83 -- place queens on a NxN chess board
86 <beginfold id='4'>if</beginfold id='4'> length(queens) = N then
88 print_board(queens)
91 r = length(queens)+1
93 <beginfold id='4'>if</beginfold id='4'> not conflict({r,c}, queens) then
[all …]
/dports/math/py-or-tools/or-tools-9.2/examples/cpp/
H A Dnqueens.cc202 std::vector<IntVar*> queens; in NQueens() local
204 queens.push_back( in NQueens()
207 s.AddConstraint(s.MakeAllDifferent(queens)); in NQueens()
211 vars[i] = s.MakeSum(queens[i], i)->Var(); in NQueens()
215 vars[i] = s.MakeSum(queens[i], -i)->Var(); in NQueens()
222 collector->Add(queens); in NQueens()
230 NQueenSymmetry* const sx = s.RevAlloc(new SX(&s, queens)); in NQueens()
232 NQueenSymmetry* const sy = s.RevAlloc(new SY(&s, queens)); in NQueens()
234 NQueenSymmetry* const sd1 = s.RevAlloc(new SD1(&s, queens)); in NQueens()
236 NQueenSymmetry* const sd2 = s.RevAlloc(new SD2(&s, queens)); in NQueens()
[all …]
/dports/benchmarks/phoronix-test-suite/phoronix-test-suite-10.6.1/ob-cache/test-profiles/pts/m-queens-1.0.1/
H A Dinstall.sh3 tar -zxvf m-queens-1.1.tar.gz
5 cd m-queens-1.1/
15 g++ -fopenmp $CFLAGS main.c -o m-queens.bin
23 echo $? > ~/test-exit-status" > m-queens
24 chmod +x m-queens
/dports/benchmarks/phoronix-test-suite/phoronix-test-suite-10.6.1/ob-cache/test-profiles/pts/m-queens-1.1.0/
H A Dinstall.sh3 tar -zxvf m-queens-1.2.tar.gz
5 cd m-queens-1.2/
15 g++ -fopenmp $CFLAGS main.c -o m-queens.bin
23 echo $? > ~/test-exit-status" > m-queens
24 chmod +x m-queens

12345678910>>...33