| /dports/games/crafty/crafty-25.2_1/ |
| H A D | attacks.c | 15 if ((rook_attacks[square] & (Rooks(side) | Queens(side))) in Attacks()
17 OccupiedSquares) & (Rooks(side) | Queens(side)))) in Attacks()
19 if ((bishop_attacks[square] & (Bishops(side) | Queens(side))) in Attacks()
21 OccupiedSquares) & (Bishops(side) | Queens(side)))) in Attacks()
51 Bishops(white) | Bishops(black) | Queens(white) | Queens(black); in AttacksTo()
53 Rooks(white) | Rooks(black) | Queens(white) | Queens(black); in AttacksTo()
105 bsliders = Bishops(side) | Queens(side); in Attacked()
106 rsliders = Rooks(side) | Queens(side); in Attacked()
|
| H A D | see.c | 26 Bishops(white) | Bishops(black) | Queens(white) | Queens(black); in SEE()
28 Rooks(white) | Rooks(black) | Queens(white) | Queens(black); in SEE()
120 Bishops(white) | Bishops(black) | Queens(white) | Queens(black); in SEEO()
122 Rooks(white) | Rooks(black) | Queens(white) | Queens(black); in SEEO()
|
| H A D | root.c | 50 Kings(white) | Kings(black), Queens(white) | Queens(black), in RootMoveList()
110 Kings(white) | Kings(black), Queens(white) | Queens(black), in RootMoveList()
265 Kings(white) | Kings(black), Queens(white) | Queens(black), in RootMoveEGTB()
336 Kings(white) | Kings(black), Queens(white) | Queens(black), in RootMoveEGTB()
|
| H A D | validate.c | 41 Queens(side) in ValidatePosition()
64 Queens(white) ^ Pawns(black) ^ Knights(black) ^ Bishops(black) ^ in ValidatePosition()
65 Rooks(black) ^ Queens(black) ^ Kings(white) ^ Kings(black); in ValidatePosition()
68 Queens(white) | Pawns(black) | Knights(black) | Bishops(black) | in ValidatePosition()
69 Rooks(black) | Queens(black) | Kings(white) | Kings(black); in ValidatePosition()
|
| H A D | movgen.c | 60 for (piecebd = Queens(side); piecebd; Clear(from, piecebd)) { in GenerateCaptures()
218 for (piecebd = Queens(side); piecebd; Clear(from, piecebd)) { in GenerateChecks()
267 OccupiedSquares & ~blockers) & (Bishops(side) | Queens(side)); in GenerateChecks()
349 OccupiedSquares & ~blockers) & (Rooks(side) | Queens(side)); in GenerateChecks()
549 for (piecebd = Queens(side); piecebd; Clear(from, piecebd)) { in GenerateCheckEvasions()
745 for (piecebd = Queens(side); piecebd; Clear(from, piecebd)) { in GenerateNoncaptures()
884 return (RankAttacks(square) & (Rooks(enemy) | Queens(enemy))) != 0; in PinnedOnKing()
889 return (Diagh1Attacks(square) & (Bishops(enemy) | Queens(enemy))) != in PinnedOnKing()
895 return (FileAttacks(square) & (Rooks(enemy) | Queens(enemy))) != 0; in PinnedOnKing()
900 return (Diaga1Attacks(square) & (Bishops(enemy) | Queens(enemy))) != in PinnedOnKing()
|
| /dports/math/gecode/gecode-0916a1a/examples/ |
| H A D | queens.cpp | 56 class Queens : public Script { class
67 Queens(const SizeOptions& opt) in Queens() function in Queens
97 Queens(Queens& s) : Script(s) { in Queens() function in Queens
104 return new Queens(*this); in copy()
135 const Queens& q = static_cast<const Queens&>(s); in inspect()
194 opt.propagation(Queens::PROP_DISTINCT); in main()
195 opt.propagation(Queens::PROP_BINARY, "binary", in main()
197 opt.propagation(Queens::PROP_MIXED, "mixed", in main()
199 opt.propagation(Queens::PROP_DISTINCT, "distinct", in main()
208 Script::run<Queens,DFS,SizeOptions>(opt); in main()
|
| /dports/lang/swi-pl/swipl-8.2.3/src/Tests/library/data/ |
| H A D | queens.pl | 1 queens(N, Queens) :-
2 length(Queens, N),
3 board(Queens, Board, 0, N, _, _),
4 queens(Board, 0, Queens).
7 board([_|Queens], [Col-Vars|Board], Col0, N, [_|VR], VC) :-
11 board(Queens, Board, Col, N, VR, [_|VC]).
|
| /dports/math/gecode/gecode-0916a1a/test/ |
| H A D | nogoods.cpp | 55 class Queens : public Space { class
62 Queens(IntValBranch ivb, bool assign, bool null) in Queens() function in Test::NoGoods::Queens
85 Queens(Queens& s) : Space(s) { in Queens() function in Test::NoGoods::Queens
90 return new Queens(*this); in copy()
93 bool same(const Queens& s) const { in same()
277 (void) new NoGoods<Queens,IntValBranch>(INT_VAL_MIN(),t,a,n); in Create()
278 (void) new NoGoods<Queens,IntValBranch>(INT_VAL_MAX(),t,a,n); in Create()
279 (void) new NoGoods<Queens,IntValBranch>(INT_VAL_SPLIT_MIN(),t,a,n); in Create()
280 (void) new NoGoods<Queens,IntValBranch>(INT_VAL_SPLIT_MAX(),t,a,n); in Create()
281 (void) new NoGoods<Queens,IntValBranch>(INT_VALUES_MIN(),t,a,n); in Create()
[all …]
|
| /dports/math/yacas/yacas-1.9.1/scripts/examples/ |
| H A D | queens.ys | 4 /* Queens(n) : main entry function. This function returns a list of
10 * only on Queens(n), since that is the only function that should be
13 Queens(n_IsPositiveInteger) <--
17 Queens(n,{},1 .. n,result); /* build result */
49 Queens(MathSubtract(n,1),element:try,use,result);
56 10 # Queens( 0,_try,_touse,_result) <-- DestructiveInsert(result,1,try);
57 20 # Queens(_n,_try,_touse,_result) <--
|
| /dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/examples/fd/ |
| H A D | Queens.java | 49 public class Queens extends ExampleFD { class
243 Queens example = new Queens(); in main()
265 Queens example = new Queens(); in test()
277 example = new Queens(); in test()
289 example = new Queens(); in test()
|
| /dports/math/chuffed/chuffed-e04bedd/chuffed/examples/ |
| H A D | queens.cpp | 9 class Queens : public Problem { class
14 Queens(int _n) : n(_n) { in Queens() function in Queens
84 engine.solve(new Queens(n)); in main()
|
| /dports/misc/p5-Geo-Address-Formatter/Geo-Address-Formatter-1.96/address-formatting/testcases/countries/ |
| H A D | bw.yaml | 9 road: Queens Road
13 Queens Road
|
| /dports/math/clingo/clingo-5.5.1/examples/clingo/incqueens/ |
| H A D | README.md | 1 # Incremantally Solving the n-Queens Problem
3 In this example, we calculate solutions for the n-Queens problem for different
|
| /dports/devel/py-os-brick/os-brick-5.1.0/releasenotes/notes/ |
| H A D | delay-legacy-encryption-provider-name-deprecation-c0d07be3f0d92afd.yaml | 6 now be blocked in the Queens release of os-brick. The use of out of tree
8 be blocked in the Queens release of os-brick.
|
| /dports/games/domination/Domination/maps/ |
| H A D | NYC.map | 12 Queens 6 orange
36 20 Queens-Village 3 629 285
|
| H A D | union.map | 25 6 Queens-Hall-Foyer 2 41 318
51 32 Queens-Hall-Stage 3 283 208
|
| /dports/misc/libpostal/libpostal-1.1-alpha/resources/boundaries/names/ |
| H A D | global.yaml | 64 - id: 369519 # Queens County (don't use Queens)
66 default: name # Queens County
|
| /dports/textproc/kf5-syntax-highlighting/syntax-highlighting-5.89.0/autotests/input/ |
| H A D | highlight.exu | 8 -- The N Queens Problem:
9 -- Place N Queens on an NxN chess board
52 -- print a solution, showing the Queens on the board
|
| /dports/textproc/p5-Syntax-Highlight-Engine-Kate/Syntax-Highlight-Engine-Kate-0.14/samples/ |
| H A D | highlight.exu | 8 -- The N Queens Problem:
9 -- Place N Queens on an NxN chess board
52 -- print a solution, showing the Queens on the board
|
| /dports/databases/py-gdbm/Python-3.8.12/Tools/demo/ |
| H A D | queens.py | 14 class Queens: class
79 q = Queens(n)
|
| /dports/databases/py-sqlite3/Python-3.8.12/Tools/demo/ |
| H A D | queens.py | 14 class Queens: class
79 q = Queens(n)
|
| /dports/lang/python27/Python-2.7.18/Demo/scripts/ |
| H A D | queens.py | 14 class Queens: class
79 q = Queens(n)
|
| /dports/lang/python-tools/Python-3.8.12/Tools/demo/ |
| H A D | queens.py | 14 class Queens: class
79 q = Queens(n)
|
| /dports/lang/python310/Python-3.10.1/Tools/demo/ |
| H A D | queens.py | 14 class Queens: class
79 q = Queens(n)
|
| /dports/lang/python311/Python-3.11.0a3/Tools/demo/ |
| H A D | queens.py | 14 class Queens: class
79 q = Queens(n)
|