summaryrefslogtreecommitdiff
path: root/prolog/problems/clp_fd/magic_1
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/clp_fd/magic_1')
-rw-r--r--prolog/problems/clp_fd/magic_1/en.py6
-rw-r--r--prolog/problems/clp_fd/magic_1/sl.py6
2 files changed, 6 insertions, 6 deletions
diff --git a/prolog/problems/clp_fd/magic_1/en.py b/prolog/problems/clp_fd/magic_1/en.py
index c8b5a1a..0798164 100644
--- a/prolog/problems/clp_fd/magic_1/en.py
+++ b/prolog/problems/clp_fd/magic_1/en.py
@@ -6,9 +6,9 @@ slug = 'generate a 3x3 magic square'
description = '''\
<p><code>magic(S)</code>: the list <code>S</code> represents a 3×3 magic square (<code>S</code> is a permutation of numbers 1 to 9 - three numbers for each row). The sums of numbers in each row, column and diagonal of a magic squre are equal. Implement this predicate using constraints. Your code should return all possible solutions.</p>
<pre>
- ?- magic(S).
- S = [2, 7, 6, 9, 5, 1, 4, 3, 8] ;
- …
+?- magic(S).
+ S = [2, 7, 6, 9, 5, 1, 4, 3, 8] ;
+ …
</pre>'''
hint = {}
diff --git a/prolog/problems/clp_fd/magic_1/sl.py b/prolog/problems/clp_fd/magic_1/sl.py
index 8cf040e..fa73a01 100644
--- a/prolog/problems/clp_fd/magic_1/sl.py
+++ b/prolog/problems/clp_fd/magic_1/sl.py
@@ -6,9 +6,9 @@ slug = '3x3 magični kvadrat'
description = '''\
<p><code>magic(S)</code>: seznam <code>S</code> predstavlja 3×3 magični kvadrat (<code>S</code> je permutacija števil 1 do 9 -- tri števila tvorijo eno vrstico). Vsote števil v vsaki vrstici, stolpcu in glavni diagonali magičnega kvadrata so enake. Implementiraj ta predikat z uporabo omejitev. Predikat naj vrne vse rešitve, eno po eno.</p>
<pre>
- ?- magic(S).
- S = [2, 7, 6, 9, 5, 1, 4, 3, 8] ;
- …
+?- magic(S).
+ S = [2, 7, 6, 9, 5, 1, 4, 3, 8] ;
+ …
</pre>'''
hint = {}