eyeprolog 1.3.18 → 1.3.20

package/README.md

@@ -292,7 +292,7 @@ npm run test:interop
 ```
 
 The GitHub interoperability workflow builds both implementations and runs the
-same portable Sudoku source under EyeProlog, Trealla, and Scryer.
+same portable Towers of Hanoi source under EyeProlog, Trealla, and Scryer.
 
 ## Development
 

package/examples/clpz-n-queens.pl

@@ -4,11 +4,19 @@
 % The list position is a column and its value is a row. Domains, global
 % distinctness, and delayed diagonal constraints describe the puzzle before
 % labeling searches the remaining finite alternatives.
+%
+% The main example records one witness for the classic eight-queens problem.
+% A smaller four-queens query also checks that queens/2 still enumerates
+% multiple solutions without carrying a 92-answer golden file.
 
-%% goal: queens(X0, X1)
+%% goal: queens8_solution(X0)
+%% goal: queens(4, X0)
+
+queens8_solution(Rows) :-
+  queens(8, Rows),
+  !.
 
 queens(Size, Rows) :-
-  Size = 6,
   length(Rows, Size),
   Rows ins 1..Size,
   all_distinct(Rows),
@@ -26,4 +34,3 @@ safe_from(Row, [Other|Rows], Distance) :-
   Row #\= Other - Distance,
   NextDistance is Distance + 1,
   safe_from(Row, Rows, NextDistance).
-

package/examples/observability-log-correlation.pl

@@ -20,10 +20,17 @@ raw_log(l2, 'ts=2026-06-18T10:00:03Z level=error event=payment_denied user=alice
 raw_log(l3, 'ts=2026-06-18T10:01:12Z level=info event=login_success user=bob ip=198.51.100.4 traceparent=00-aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa-bbbbbbbbbbbbbbbb-01').
 raw_log(noise, 'healthcheck ok').
 
+% Walk the batch recursively so EyeProlog can table parsed_logs/3 and reuse
+% each regex parse across the captured-field, event, and alert queries.
 parsed(Log, Context) :-
-  raw_log(Log, Text),
+  findall(raw(Log0, Text), raw_log(Log0, Text), Logs),
+  parsed_logs(Logs, Log, Context).
+
+parsed_logs([raw(Log, Text)|_], Log, Context) :-
   log_pattern(Pattern),
   matches(Text, Pattern, Context).
+parsed_logs([_|Logs], Log, Context) :-
+  parsed_logs(Logs, Log, Context).
 
 context_member((Left, _right), Member) :- context_member(Left, Member).
 context_member((_left, Right), Member) :- context_member(Right, Member).
@@ -46,4 +53,4 @@ parsed_event(Log, Event, User, Ip, Traceid) :-
 trace_alert(User, Traceid, Ip) :-
   parsed_event(Loginlog, 'login_failed', User, Ip, Traceid),
   parsed_event(Paymentlog, 'payment_denied', User, Ip, Traceid),
-  (Loginlog \= Paymentlog).
+  Loginlog \= Paymentlog.

package/examples/output/clpz-n-queens.pl

@@ -1,4 +1,3 @@
-queens(6, [2, 4, 6, 1, 3, 5]).
-queens(6, [3, 6, 2, 5, 1, 4]).
-queens(6, [4, 1, 5, 2, 6, 3]).
-queens(6, [5, 3, 1, 6, 4, 2]).
+queens8_solution([1, 5, 8, 6, 3, 7, 2, 4]).
+queens(4, [2, 4, 1, 3]).
+queens(4, [3, 1, 4, 2]).

package/package.json

@@ -3,7 +3,7 @@
   "publishConfig": {
     "access": "public"
   },
-  "version": "1.3.18",
+  "version": "1.3.20",
   "description": "EyeProlog turns facts and rules into answers and proofs.",
   "type": "module",
   "main": "./index.js",

package/playground.html

@@ -577,7 +577,6 @@
           "modal-logic-kripke",
           "modular-exponentiation",
           "monkey-bananas",
-          "n-queens",
           "network-sla",
           "newton-raphson",
           "nixon-diamond",
@@ -629,7 +628,6 @@
           "stable-marriage",
           "statistics-summary",
           "stirling-bell-numbers",
-          "sudoku",
           "superdense-coding",
           "symbolic-derivative",
           "takeuchi",

package/test/run-interop.mjs

@@ -11,25 +11,25 @@ import { fileURLToPath } from 'node:url';
 
 const root = path.resolve(path.dirname(fileURLToPath(import.meta.url)), '..');
 const allowMissing = process.argv.includes('--allow-missing');
-const sudoku = path.join(root, 'examples', 'sudoku.pl');
-const goal = 'sudoku_solution(S), write(S), nl, fail; halt';
-const expected = '[[5,3,4,6,7,8,9,1,2],[6,7,2,1,9,5,3,4,8],[1,9,8,3,4,2,5,6,7],[8,5,9,7,6,1,4,2,3],[4,2,6,8,5,3,7,9,1],[7,1,3,9,2,4,8,5,6],[9,6,1,5,3,7,2,8,4],[2,8,7,4,1,9,6,3,5],[3,4,5,2,8,6,1,7,9]]';
+const hanoi = path.join(root, 'examples', 'hanoi.pl');
+const goal = 'hanoi(3,left,right,center,Moves), write(Moves), nl, halt';
+const expected = '[[left,right],[left,center],[right,center],[left,right],[center,left],[center,right],[left,right]]';
 
 const engines = [
   {
     name: 'EyeProlog',
     command: process.execPath,
-    args: [path.join(root, 'bin', 'eyeprolog.js'), '--portable', '-g', goal, sudoku],
+    args: [path.join(root, 'bin', 'eyeprolog.js'), '--portable', '-g', goal, hanoi],
   },
   {
     name: 'Trealla',
     command: process.env.TPL ?? 'tpl',
-    args: ['-q', '-g', goal, sudoku],
+    args: ['-q', '-g', goal, hanoi],
   },
   {
     name: 'Scryer',
     command: process.env.SCRYER_PROLOG ?? 'scryer-prolog',
-    args: ['-f', '-g', goal, sudoku],
+    args: ['-f', '-g', goal, hanoi],
   },
 ];
 
@@ -64,13 +64,13 @@ for (const engine of engines) {
   }
   const lines = String(result.stdout ?? '').split(/\r?\n/).map((line) => line.trim()).filter(Boolean);
   if (!lines.includes(expected)) {
-    console.error(`FAIL ${engine.name}: Sudoku output mismatch`);
+    console.error(`FAIL ${engine.name}: Hanoi output mismatch`);
     console.error(`stdout: ${JSON.stringify(result.stdout)}`);
     if (result.stderr) console.error(`stderr: ${result.stderr.trim()}`);
     failed = true;
     continue;
   }
-  console.log(`OK ${engine.name}: portable Sudoku`);
+  console.log(`OK ${engine.name}: portable Hanoi`);
 }
 
 if (failed) process.exitCode = 1;

package/test/run-regression.mjs

@@ -2189,7 +2189,7 @@ child.stdin.write(\`consult(${consultedAtom}).\\n\`);
     {
       name: 'npm exec can run package CLI bin from checkout',
       run: () => {
-        const result = spawnSync('npm', ['exec', '--loglevel=silent', '--yes', '--package=.', '--', 'eyeprolog', '--version'], {
+        const result = spawnSync('npm', ['exec', '--offline', '--loglevel=silent', '--yes', '--package=.', '--', 'eyeprolog', '--version'], {
           cwd: packageRoot,
           encoding: 'utf8',
           env: { ...process.env, npm_config_update_notifier: 'false' },
@@ -3797,30 +3797,30 @@ answer(ok) :-
         `;
         const script = `
           import { Program, Solver, Env, parseGoalText, getEyePrologRegistry } from ${JSON.stringify(engineUrl)};
-          const program = Program.parse(${JSON.stringify(programText)}, { autoloadGoals: ['ti(R,3,0)'] });
+          const program = Program.parse(${JSON.stringify(programText)}, { autoloadGoals: ['ti(R,1,0)'] });
           const listTailGroup = program.findGroup('...', 2, 'user');
           if (listTailGroup?.listTailRecursive !== true) {
             throw new Error('recursive DCG tail-consumption was not recognized');
           }
           const solver = new Solver(program, { registry: getEyePrologRegistry(), maxMemoryBytes: Infinity });
-          const goal = parseGoalText('ti(R,3,0)', {
+          const goal = parseGoalText('ti(R,1,0)', {
             doubleQuotes: 'chars',
             operatorDefinitions: [...program.operators.values()],
           });
           let count = 0;
           for (const _ of solver.solve([goal], new Env(), 0)) {
-            if (++count === 20) break;
+            if (++count === 10) break;
           }
-          if (count !== 20) throw new Error('unexpected checkpoint count: ' + count);
+          if (count !== 10) throw new Error('unexpected checkpoint count: ' + count);
           const scope = solver.innerTableScopes.get('phrase');
           if (scope == null) throw new Error('missing phrase table scope');
           if (scope.memo.size !== 0) throw new Error('distinct tail-DCG inputs should not retain phrase tables: ' + scope.memo.size);
           process.stdout.write(count + ':' + scope.memo.size);
         `;
         const result = spawnSync(process.execPath, [
-          // This corresponds to 20,000 accepted number candidates. Before the
-          // phrase-local cache, every distinct recursive DCG tail stayed rooted
-          // in the caller memo and this workload exhausted a 32 MiB old space.
+          // This covers 100 accepted number candidates, enough to exercise
+          // many distinct recursive DCG inputs while keeping this a focused
+          // bounded-cache regression rather than a memory stress benchmark.
           '--max-old-space-size=32',
           '--input-type=module',
           '--eval',
@@ -3829,7 +3829,7 @@ answer(ok) :-
         if (result.error) throw result.error;
         assertEqual(result.status, 0, `bounded phrase-table child status; stderr=${result.stderr}`);
         const [countText, cacheText] = result.stdout.trim().split(':');
-        assertEqual(countText, '20', 'recursive phrase checkpoints');
+        assertEqual(countText, '10', 'recursive phrase checkpoints');
         assertEqual(cacheText, '0', 'distinct tail-DCG phrase cache');
       },
     },
@@ -4886,10 +4886,22 @@ path(X, Z) :- edge(X, Y), path(Y, Z).
       },
     },
     {
-      name: 'n-queens example keeps recursive search predicates tabled',
+      name: 'recursive search pattern keeps scan and search predicates tabled',
       run: () => {
-        const text = fs.readFileSync(path.join(packageRoot, 'examples', 'n-queens.pl'), 'utf8');
-        const program = Program.parseSources([{ text, filename: 'n-queens.pl' }]);
+        const text = `
+          queens([], Qs, Qs).
+          queens(Us, Ps, Qs) :-
+            select(Q, Us, Us1),
+            \+ attack(Q, 1, Ps),
+            queens(Us1, [Q|Ps], Qs).
+
+          attack(X, N, [Y|_]) :- X is Y + N.
+          attack(X, N, [Y|_]) :- X is Y - N.
+          attack(X, N, [_|Ys]) :-
+            N1 is N + 1,
+            attack(X, N1, Ys).
+        `;
+        const program = Program.parseSources([{ text, filename: 'recursive-search.pl' }]);
         const attack = program.findGroup('attack', 3);
         assertEqual(Boolean(attack), true, 'attack/3 group exists');
         assertEqual(attack.tabled, true, 'attack/3 tabled');

package/the-art-of-eyeprolog.md

@@ -4076,8 +4076,8 @@ generation contains `n^k` leaves. If order does not matter, permutations may
 be redundant. If partial choices already violate a constraint, pruning saves
 an entire subtree.
 
-This is why combinatorial examples are not toys. `n-queens.pl` exposes the
-complete 92-solution search. Together with `send-more-money.pl`,
+This is why combinatorial examples are not toys. `clpz-n-queens.pl` exposes
+the classic eight-queens search through finite-domain constraints. Together with `send-more-money.pl`,
 `integer-partitions.pl`, `stirling-bell-numbers.pl`,
 and `weighted-interval-scheduling.pl`, they show different geometries of
 choice: permutations, digit assignments, recursive decompositions, set
@@ -6301,7 +6301,7 @@ library autoloading.
 calls to non-profile predicates from otherwise common modules. `--portable`
 turns those diagnostics into a failing run, making the conservative profile
 suitable for continuous integration. `npm run test:interop` executes the same
-portable Sudoku source under EyeProlog, Trealla, and Scryer when those commands
+portable Towers of Hanoi source under EyeProlog, Trealla, and Scryer when those commands
 are installed; the repository interoperability workflow installs them and runs
 that check.
 
@@ -6769,7 +6769,7 @@ For example:
 eyeprolog --goal 'ancestor(X, Y)' examples/ancestor.pl
 eyeprolog --proof --goal 'type(X, Y)' examples/socrates.pl
 eyeprolog --warnings --goal 'answer(X)' test/conformance/warnings/negation/unstratified_mutual.pl
-eyeprolog --portable --goal 'sudoku_solution(S)' examples/sudoku.pl
+eyeprolog --portable --goal 'sudoku9_solution(S)' examples/clpz-sudoku-9x9.pl
 eyeprolog --stats --goal 'path(a, X)' examples/path-discovery.pl > answers.pl 2> run.stats
 ```
 
@@ -6951,7 +6951,7 @@ Review questions:
 </figure>
 
 The [examples directory](https://github.com/eyereasoner/eyeprolog/tree/main/examples/) is the book's executable companion. The
-top-level directory contains **212 self-contained runnable programs**. Every
+top-level directory contains **210 self-contained runnable programs**. Every
 source program has an exact answer file under
 [examples/output](https://github.com/eyereasoner/eyeprolog/tree/main/examples/output/), and **61 selected programs** have a checked
 explanation under [examples/proof](https://github.com/eyereasoner/eyeprolog/tree/main/examples/proof/). The thematic tables below link every top-level program and open the program
@@ -7001,7 +7001,7 @@ mode at a time.
 | --- | --- | --- |
 | [CLP(Z) factorial](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-factorial.pl) | Declarative predecessor and product constraints propagate a factorial without mode-sensitive `is/2`. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-factorial.pl) |
 | [CLP(Z) global constraints](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-global-constraints.pl) | Compatibility tables, lexicographic and serialized schedules, global cardinality with costs, circuits, value counting, and integer comparison. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-global-constraints.pl) |
-| [CLP(Z) N-queens](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-n-queens.pl) | Six-queens using finite domains, delayed diagonal constraints, `all_distinct/1`, and first-fail labeling. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-n-queens.pl) |
+| [CLP(Z) N-queens](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-n-queens.pl) | Eight-queens using finite domains, delayed diagonal constraints, `all_distinct/1`, and first-fail labeling, plus a small multi-solution enumeration check. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-n-queens.pl) |
 | [CLP(Z) resource allocation](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-resource-allocation.pl) | Resource assignment using `element/3`, `sum/3`, `scalar_product/4`, reification, labeling options, and domain reflection. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-resource-allocation.pl) |
 | [CLP(Z) Sudoku 9×9](https://github.com/eyereasoner/eyeprolog/blob/main/examples/clpz-sudoku-9x9.pl) | The difficult AI Escargot puzzle modeled with finite domains, 27 all-distinct constraints, and first-fail labeling. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/clpz-sudoku-9x9.pl) |
 | [Combinatorics Findall Sort](https://github.com/eyereasoner/eyeprolog/blob/main/examples/combinatorics-findall-sort.pl) | Eyelet-inspired combinations example using `findall/3` and ISO `sort/2`. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/combinatorics-findall-sort.pl) |
@@ -7097,11 +7097,9 @@ finite search space, and which constraint removes which branches?
 | [Map Four Color Search](https://github.com/eyereasoner/eyeprolog/blob/main/examples/map-four-color-search.pl) | Four-colour search for the European Union neighbour graph. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/map-four-color-search.pl) |
 | [Markov Logic Network](https://github.com/eyereasoner/eyeprolog/blob/main/examples/markov-logic-network.pl) | Markov Logic Network style scoring over a tiny finite domain. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/markov-logic-network.pl) |
 | [Matrix Chain Order](https://github.com/eyereasoner/eyeprolog/blob/main/examples/matrix-chain-order.pl) | Matrix-chain multiplication order by automatically tabled interval dynamic programming. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/matrix-chain-order.pl) |
-| [N-Queens enumeration](https://github.com/eyereasoner/eyeprolog/blob/main/examples/n-queens.pl) | `select/3` chooses each row and diagonal checks prune partial placements; the query enumerates all 92 eight-queen solutions in the default runtime. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/n-queens.pl) |
 | [Register allocation](https://github.com/eyereasoner/eyeprolog/blob/main/examples/register-allocation.pl) | Interference constraints turn compiler allocation into graph coloring. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/register-allocation.pl) |
 | [SEND + MORE = MONEY](https://github.com/eyereasoner/eyeprolog/blob/main/examples/send-more-money.pl) | Digit assignments are generated under distinctness, leading-zero, and column constraints. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/send-more-money.pl) |
 | [Stable marriage](https://github.com/eyereasoner/eyeprolog/blob/main/examples/stable-marriage.pl) | Preference data, matching generation, and the absence of blocking pairs define stability. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/stable-marriage.pl) |
-| [Sudoku 9×9](https://github.com/eyereasoner/eyeprolog/blob/main/examples/sudoku.pl) | Minimum-remaining-values search fills a standard grid while enforcing row, column, and 3×3 block constraints. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/sudoku.pl) |
 | [Weighted interval scheduling](https://github.com/eyereasoner/eyeprolog/blob/main/examples/weighted-interval-scheduling.pl) | Compatibility constraints and an ordered objective select a maximum-value schedule. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/weighted-interval-scheduling.pl) · [proof](https://github.com/eyereasoner/eyeprolog/blob/main/examples/proof/weighted-interval-scheduling.pl) |
 | [Zebra puzzle](https://github.com/eyereasoner/eyeprolog/blob/main/examples/zebra.pl) | House records, adjacency relations, and clue constraints jointly determine the famous solution. | [answers](https://github.com/eyereasoner/eyeprolog/blob/main/examples/output/zebra.pl) |
 
@@ -7354,7 +7352,7 @@ hand.
 
 #### Running and extending the corpus
 
-Run all 212 normal answer goldens and the 61 selected proof goldens with:
+Run all 210 normal answer goldens and the 61 selected proof goldens with:
 
 ```sh
 npm run test:examples
@@ -7418,7 +7416,7 @@ The complete suite must pass before release. The file-based conformance corpus
 contains 791 cases, including 386 focused ISO
 cases derived from the success, failure, mode, and error behavior in
 ISO/IEC 13211-1 clauses 7 and 8, Part 2 modules, and Part 3 grammar rules.
-Separate exact-output suites check 212 normal
+Separate exact-output suites check 210 normal
 examples and 61 proof examples; all extracted book programs are parsed and
 their declared goals are executed. The eight-case
 playground contract suite imports the production worker, sends real reasoning

package/examples/n-queens.pl

@@ -1,36 +0,0 @@
-:- use_module(library(lists)).
-
-% N-Queens puzzle
-% See https://en.wikipedia.org/wiki/Eight_queens_puzzle
-% Original code at https://hanslen.github.io/2016/05/02/AI-problem-N-queens-problem-%E2%80%93-solved-in-prolog/
-
-queens(N, Qs) :-
-    range(1, N, Us),
-    queens(Us, [], Qs).
-
-% queens(+Unplaced, ?Placed, ?Queens)
-queens([], Qs, Qs).
-queens(Us, Ps, Qs) :-
-    select(Q, Us, Us1),
-    \+attack(Q, 1, Ps),
-    queens(Us1, [Q|Ps], Qs).
-
-% range(+I, +J, -Ns): Ns is the list of integers between I and J inclusive
-range(J, J, [J]).
-range(I, J, [I|Ns]) :-
-    I < J,
-    I1 is I+1,
-    range(I1, J, Ns).
-
-% attack(+Q, +N, +Qs): queen in row Q attacks from distance N one or more of the queens in rows Qs on a diagonal
-attack(X, N, [Y|_]) :-
-    X is Y+N.
-attack(X, N, [Y|_]) :-
-    X is Y-N.
-attack(X, N, [_|Ys]) :-
-    N1 is N+1,
-    attack(X, N1, Ys).
-
-% query
-%% goal: queens(8, _)
-

package/examples/output/n-queens.pl

@@ -1,92 +0,0 @@
-queens(8, [4, 2, 7, 3, 6, 8, 5, 1]).
-queens(8, [5, 2, 4, 7, 3, 8, 6, 1]).
-queens(8, [3, 5, 2, 8, 6, 4, 7, 1]).
-queens(8, [3, 6, 4, 2, 8, 5, 7, 1]).
-queens(8, [5, 7, 1, 3, 8, 6, 4, 2]).
-queens(8, [4, 6, 8, 3, 1, 7, 5, 2]).
-queens(8, [3, 6, 8, 1, 4, 7, 5, 2]).
-queens(8, [5, 3, 8, 4, 7, 1, 6, 2]).
-queens(8, [5, 7, 4, 1, 3, 8, 6, 2]).
-queens(8, [4, 1, 5, 8, 6, 3, 7, 2]).
-queens(8, [3, 6, 4, 1, 8, 5, 7, 2]).
-queens(8, [4, 7, 5, 3, 1, 6, 8, 2]).
-queens(8, [6, 4, 2, 8, 5, 7, 1, 3]).
-queens(8, [6, 4, 7, 1, 8, 2, 5, 3]).
-queens(8, [1, 7, 4, 6, 8, 2, 5, 3]).
-queens(8, [6, 8, 2, 4, 1, 7, 5, 3]).
-queens(8, [6, 2, 7, 1, 4, 8, 5, 3]).
-queens(8, [4, 7, 1, 8, 5, 2, 6, 3]).
-queens(8, [5, 8, 4, 1, 7, 2, 6, 3]).
-queens(8, [4, 8, 1, 5, 7, 2, 6, 3]).
-queens(8, [2, 7, 5, 8, 1, 4, 6, 3]).
-queens(8, [1, 7, 5, 8, 2, 4, 6, 3]).
-queens(8, [2, 5, 7, 4, 1, 8, 6, 3]).
-queens(8, [4, 2, 7, 5, 1, 8, 6, 3]).
-queens(8, [5, 7, 1, 4, 2, 8, 6, 3]).
-queens(8, [6, 4, 1, 5, 8, 2, 7, 3]).
-queens(8, [5, 1, 4, 6, 8, 2, 7, 3]).
-queens(8, [5, 2, 6, 1, 7, 4, 8, 3]).
-queens(8, [6, 3, 7, 2, 8, 5, 1, 4]).
-queens(8, [2, 7, 3, 6, 8, 5, 1, 4]).
-queens(8, [7, 3, 1, 6, 8, 5, 2, 4]).
-queens(8, [5, 1, 8, 6, 3, 7, 2, 4]).
-queens(8, [1, 5, 8, 6, 3, 7, 2, 4]).
-queens(8, [3, 6, 8, 1, 5, 7, 2, 4]).
-queens(8, [6, 3, 1, 7, 5, 8, 2, 4]).
-queens(8, [7, 5, 3, 1, 6, 8, 2, 4]).
-queens(8, [7, 3, 8, 2, 5, 1, 6, 4]).
-queens(8, [5, 3, 1, 7, 2, 8, 6, 4]).
-queens(8, [2, 5, 7, 1, 3, 8, 6, 4]).
-queens(8, [3, 6, 2, 5, 8, 1, 7, 4]).
-queens(8, [6, 1, 5, 2, 8, 3, 7, 4]).
-queens(8, [8, 3, 1, 6, 2, 5, 7, 4]).
-queens(8, [2, 8, 6, 1, 3, 5, 7, 4]).
-queens(8, [5, 7, 2, 6, 3, 1, 8, 4]).
-queens(8, [3, 6, 2, 7, 5, 1, 8, 4]).
-queens(8, [6, 2, 7, 1, 3, 5, 8, 4]).
-queens(8, [3, 7, 2, 8, 6, 4, 1, 5]).
-queens(8, [6, 3, 7, 2, 4, 8, 1, 5]).
-queens(8, [4, 2, 7, 3, 6, 8, 1, 5]).
-queens(8, [7, 1, 3, 8, 6, 4, 2, 5]).
-queens(8, [1, 6, 8, 3, 7, 4, 2, 5]).
-queens(8, [3, 8, 4, 7, 1, 6, 2, 5]).
-queens(8, [6, 3, 7, 4, 1, 8, 2, 5]).
-queens(8, [7, 4, 2, 8, 6, 1, 3, 5]).
-queens(8, [4, 6, 8, 2, 7, 1, 3, 5]).
-queens(8, [2, 6, 1, 7, 4, 8, 3, 5]).
-queens(8, [2, 4, 6, 8, 3, 1, 7, 5]).
-queens(8, [3, 6, 8, 2, 4, 1, 7, 5]).
-queens(8, [6, 3, 1, 8, 4, 2, 7, 5]).
-queens(8, [8, 4, 1, 3, 6, 2, 7, 5]).
-queens(8, [4, 8, 1, 3, 6, 2, 7, 5]).
-queens(8, [2, 6, 8, 3, 1, 4, 7, 5]).
-queens(8, [7, 2, 6, 3, 1, 4, 8, 5]).
-queens(8, [3, 6, 2, 7, 1, 4, 8, 5]).
-queens(8, [4, 7, 3, 8, 2, 5, 1, 6]).
-queens(8, [4, 8, 5, 3, 1, 7, 2, 6]).
-queens(8, [3, 5, 8, 4, 1, 7, 2, 6]).
-queens(8, [4, 2, 8, 5, 7, 1, 3, 6]).
-queens(8, [5, 7, 2, 4, 8, 1, 3, 6]).
-queens(8, [7, 4, 2, 5, 8, 1, 3, 6]).
-queens(8, [8, 2, 4, 1, 7, 5, 3, 6]).
-queens(8, [7, 2, 4, 1, 8, 5, 3, 6]).
-queens(8, [5, 1, 8, 4, 2, 7, 3, 6]).
-queens(8, [4, 1, 5, 8, 2, 7, 3, 6]).
-queens(8, [5, 2, 8, 1, 4, 7, 3, 6]).
-queens(8, [3, 7, 2, 8, 5, 1, 4, 6]).
-queens(8, [3, 1, 7, 5, 8, 2, 4, 6]).
-queens(8, [8, 2, 5, 3, 1, 7, 4, 6]).
-queens(8, [3, 5, 2, 8, 1, 7, 4, 6]).
-queens(8, [3, 5, 7, 1, 4, 2, 8, 6]).
-queens(8, [5, 2, 4, 6, 8, 3, 1, 7]).
-queens(8, [6, 3, 5, 8, 1, 4, 2, 7]).
-queens(8, [5, 8, 4, 1, 3, 6, 2, 7]).
-queens(8, [4, 2, 5, 8, 6, 1, 3, 7]).
-queens(8, [4, 6, 1, 5, 2, 8, 3, 7]).
-queens(8, [6, 3, 1, 8, 5, 2, 4, 7]).
-queens(8, [5, 3, 1, 6, 8, 2, 4, 7]).
-queens(8, [4, 2, 8, 6, 1, 3, 5, 7]).
-queens(8, [6, 3, 5, 7, 1, 4, 2, 8]).
-queens(8, [6, 4, 7, 1, 3, 5, 2, 8]).
-queens(8, [4, 7, 5, 2, 6, 1, 3, 8]).
-queens(8, [5, 7, 2, 6, 3, 1, 4, 8]).

package/examples/output/sudoku.pl

@@ -1 +0,0 @@
-sudoku_solution([[5, 3, 4, 6, 7, 8, 9, 1, 2], [6, 7, 2, 1, 9, 5, 3, 4, 8], [1, 9, 8, 3, 4, 2, 5, 6, 7], [8, 5, 9, 7, 6, 1, 4, 2, 3], [4, 2, 6, 8, 5, 3, 7, 9, 1], [7, 1, 3, 9, 2, 4, 8, 5, 6], [9, 6, 1, 5, 3, 7, 2, 8, 4], [2, 8, 7, 4, 1, 9, 6, 3, 5], [3, 4, 5, 2, 8, 6, 1, 7, 9]]).

package/examples/sudoku.pl

@@ -1,113 +0,0 @@
-:- use_module(library(lists)).
-
-% A deterministic 9x9 Sudoku solver.
-%
-% Zero marks an empty cell. The solver first takes any forced move; otherwise
-% it selects the cell with the fewest candidates (minimum remaining values).
-%% goal: sudoku_solution(_)
-
-puzzle([
-  [0,3,4,6,7,8,9,1,0],
-  [6,0,2,1,9,5,3,0,8],
-  [1,9,0,3,4,2,0,6,7],
-  [8,5,9,0,6,1,4,0,3],
-  [4,2,6,8,0,3,7,9,0],
-  [0,1,3,9,2,0,8,5,6],
-  [9,6,0,5,3,7,0,8,4],
-  [2,0,7,4,1,9,6,0,5],
-  [0,4,5,2,8,6,1,7,0]
-]).
-
-sudoku_solution(Solution) :-
-  puzzle(Puzzle),
-  solve(Puzzle, Solution),
-  !.
-
-solve(Grid, Grid) :-
-  \+ empty_cell(Grid, _Row, _Column),
-  !.
-solve(Grid, Solution) :-
-  best_choice(Grid, Row, Column, Candidates),
-  member(Digit, Candidates),
-  set_cell(Grid, Row, Column, Digit, Next),
-  solve(Next, Solution).
-
-% A singleton candidate is already optimal, so take it immediately.
-best_choice(Grid, Row, Column, Candidates) :-
-  empty_cell(Grid, Row, Column),
-  candidates(Grid, Row, Column, Candidates),
-  Candidates = [_Only],
-  !.
-best_choice(Grid, Row, Column, Candidates) :-
-  findall(
-    choice(Count, R, C, Values),
-    (
-      empty_cell(Grid, R, C),
-      candidates(Grid, R, C, Values),
-      length(Values, Count)
-    ),
-    Choices
-  ),
-  sort(Choices, [choice(_Count, Row, Column, Candidates)|_]).
-
-empty_cell(Grid, Row, Column) :-
-  between(0, 8, Row),
-  nth0(Row, Grid, Cells),
-  between(0, 8, Column),
-  nth0(Column, Cells, 0).
-
-candidates(Grid, Row, Column, Candidates) :-
-  findall(
-    Digit,
-    (
-      between(1, 9, Digit),
-      allowed(Grid, Row, Column, Digit)
-    ),
-    Candidates
-  ).
-
-allowed(Grid, Row, Column, Digit) :-
-  row_unused(Grid, Row, Digit),
-  column_unused(Grid, Column, Digit),
-  block_unused(Grid, Row, Column, Digit).
-
-row_unused(Grid, Row, Digit) :-
-  nth0(Row, Grid, Cells),
-  \+ member(Digit, Cells).
-
-column_unused([], _Column, _Digit).
-column_unused([Row|Rows], Column, Digit) :-
-  nth0(Column, Row, Existing),
-  Digit \= Existing,
-  column_unused(Rows, Column, Digit).
-
-block_unused(Grid, Row, Column, Digit) :-
-  StartRow is (Row // 3) * 3,
-  EndRow is StartRow + 2,
-  StartColumn is (Column // 3) * 3,
-  block_rows_unused(Grid, StartRow, EndRow, StartColumn, Digit).
-
-block_rows_unused(_Grid, Row, EndRow, _StartColumn, _Digit) :-
-  Row > EndRow,
-  !.
-block_rows_unused(Grid, Row, EndRow, StartColumn, Digit) :-
-  nth0(Row, Grid, Cells),
-  segment_unused(Cells, StartColumn, Digit),
-  NextRow is Row + 1,
-  block_rows_unused(Grid, NextRow, EndRow, StartColumn, Digit).
-
-segment_unused(Cells, StartColumn, Digit) :-
-  nth0(StartColumn, Cells, A),
-  Middle is StartColumn + 1,
-  nth0(Middle, Cells, B),
-  End is StartColumn + 2,
-  nth0(End, Cells, C),
-  Digit \= A,
-  Digit \= B,
-  Digit \= C.
-
-set_cell(Grid, Row, Column, Digit, Result) :-
-  nth0(Row, Grid, Cells, OtherRows),
-  nth0(Column, Cells, _Old, OtherCells),
-  nth0(Column, UpdatedCells, Digit, OtherCells),
-  nth0(Row, Result, UpdatedCells, OtherRows).