From de7b441fe4ebd88fc19abbd6542cb8129f735ced Mon Sep 17 00:00:00 2001
From: Aleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>
Date: Sun, 22 May 2016 20:37:28 +0200
Subject: Denotational semantics, part #1: tests and translations added.

---
 .../prog_8puzzle_3/common.py                       | 39 ++++++++++++++++++++++
 .../denotational_semantics/prog_8puzzle_3/sl.py    | 35 +++++++++++++++++++
 2 files changed, 74 insertions(+)
 create mode 100644 prolog/problems/denotational_semantics/prog_8puzzle_3/sl.py

(limited to 'prolog/problems/denotational_semantics/prog_8puzzle_3')

diff --git a/prolog/problems/denotational_semantics/prog_8puzzle_3/common.py b/prolog/problems/denotational_semantics/prog_8puzzle_3/common.py
index 0e0d048..b88e544 100644
--- a/prolog/problems/denotational_semantics/prog_8puzzle_3/common.py
+++ b/prolog/problems/denotational_semantics/prog_8puzzle_3/common.py
@@ -1,3 +1,10 @@
+from operator import itemgetter
+import socket
+
+import prolog.engine
+import prolog.util
+from server.hints import Hint, HintPopup
+
 id = 173
 number = 40
 visible = True
@@ -34,3 +41,35 @@ instr173((R0,C0) --> (R,C)) -->
            ;
              C0>6, C=C0, R=R0)}.
 '''
+
+test_cases = [
+    ('findall(W, (W = [_], prog_8puzzle(_, W, [])), Words), Words == []',
+        [{}]),
+    ('prog_8puzzle([1,2,3,4,5,6,7,8,0]-->Out, [begin,down,right,left,end], []), Out == [1,2,3,4,5,6,7,0,8]',
+        [{}]),
+    ('prog_8puzzle([1,2,3,4,5,6,7,8,0]-->Out, [begin,up,up,left,left,end], []), Out == [0,1,2,4,5,3,7,8,6]',
+        [{}]),
+    ('prog_8puzzle([1,2,3,4,5,6,7,8,0]-->Out, [begin,left,up,right,up,left,down,down,right,end], []), \
+      Out == [1,6,2,4,5,3,7,8,0]',
+        [{}]),
+]
+
+def test(code, aux_code):
+    n_correct = 0
+    engine_id = None
+    try:
+        engine_id, output = prolog.engine.create(code=code+aux_code, timeout=1.0)
+        if engine_id is not None and 'error' not in map(itemgetter(0), output):
+            # Engine successfully created, and no syntax error in program.
+            for query, answers in test_cases:
+                if prolog.engine.check_answers(engine_id, query=query, answers=answers, timeout=1.0):
+                    n_correct += 1
+    except socket.timeout:
+        pass
+    finally:
+        if engine_id:
+            prolog.engine.destroy(engine_id)
+
+    hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_cases)}}]
+    return n_correct, len(test_cases), hints
+
diff --git a/prolog/problems/denotational_semantics/prog_8puzzle_3/sl.py b/prolog/problems/denotational_semantics/prog_8puzzle_3/sl.py
new file mode 100644
index 0000000..63744f9
--- /dev/null
+++ b/prolog/problems/denotational_semantics/prog_8puzzle_3/sl.py
@@ -0,0 +1,35 @@
+name = 'prog_8puzzle/3'
+slug = 'jezik za reševanje igre Osem s pomenom'
+
+description = '''\
+<p>
+Napiši DCG za jezik igre Osem (angl. 8-puzzle). Sintaksa tega jezika naj bo enaka kot v prejšnji nalogi.
+Prvi simbol vsake besede je simbol <code>[begin]</code>, temu pa sledi poljubno zaporedje "ukazov" iz nabora
+{<code>left</code>, <code>right</code>, <code>up</code> <code>down</code>}, na koncu pa je simbol
+<code>[end]</code>. Začetni nekončni simbol naj se imenuje <code>prog_8puzzle</code>.
+</p>
+
+<p>
+Pomen besede (programa) v tem jeziku ima obliko <code>In-->Out</code> in pomeni preslikavo
+med vhodnim seznamom <code>In</code> in izhodnim seznamom <code>Out</code>. Stanje je seznam (permutiran)
+števil od 0 do 8, kjer 0 pomeni prazno polje, ostala števila pa pomenijo oznako ustrezne ploščice. Prva
+tri števila v seznamu predstavljajo prvo vrstico stanja igre Osem, naslednja tri srednjo vrstico in zadnja
+tri spodnjo vrstico. Pomen ukazov <code>left</code>, <code>right</code>, <code>up</code> in <code>down</code>
+je "premik" praznega polja v ustrezni smeri.
+</p>
+
+<pre>
+?- prog_8puzzle([0,1,2,3,4,5,6,7,8]-->Out, [begin,down,right,end], []).
+  Out = [3,1,2,4,0,5,6,7,8].
+</pre>
+
+<p>
+Pomožni predikati (že definirani):
+</p>
+<ul>
+<li><code>findblank(List,I)</code> vrne položaj (indeks z bazo 1) <code>I</code> elementa 0 v seznamu <code>List</code></li>
+<li><code>swap(List,I,J,NewList)</code> ustvari seznam <code>NewList</code> tako, da zamenja elementa na mestih <code>I</code> in <code>J</code> v seznamu <code>List</code></li>
+</ul>
+'''
+
+hint = {}
-- 
cgit v1.2.1