From 95e2fe57f6e4639f6ae9f1fef368829d5090dbf6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ale=C5=A1=20Smodi=C5=A1?= <aless@guru.si>
Date: Tue, 18 Aug 2015 16:06:19 +0200
Subject: Exported all problems from the SQLite database into the new directory
 structure.

---
 prolog/problems/clp_fd/magic_1/en.py | 13 +++++++++++++
 1 file changed, 13 insertions(+)
 create mode 100644 prolog/problems/clp_fd/magic_1/en.py

(limited to 'prolog/problems/clp_fd/magic_1/en.py')

diff --git a/prolog/problems/clp_fd/magic_1/en.py b/prolog/problems/clp_fd/magic_1/en.py
new file mode 100644
index 0000000..6fcf252
--- /dev/null
+++ b/prolog/problems/clp_fd/magic_1/en.py
@@ -0,0 +1,13 @@
+id = 151
+name = 'magic/1'
+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] ;
+    …
+</pre>'''
+
+hint = {}
-- 
cgit v1.2.1