diff options
| author | Aleksander Sadikov <aleksander.sadikov@fri.uni-lj.si> | 2016-03-14 18:37:55 +0100 |
|---|---|---|
| committer | Aleksander Sadikov <aleksander.sadikov@fri.uni-lj.si> | 2016-03-14 18:37:55 +0100 |
| commit | 2c7e739593489419338c85fd67f9d6ee4f377a6e (patch) | |
| tree | 8bd0424d1381fa4cd82db1be51ec1a4914b7f203 | |
| parent | 436956e015a62557c522e56265fb0351463cd419 (diff) | |
Hint for conc/3 corrected.
| -rw-r--r-- | prolog/problems/lists/conc_3/common.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/prolog/problems/lists/conc_3/common.py b/prolog/problems/lists/conc_3/common.py index fd97865..105f801 100644 --- a/prolog/problems/lists/conc_3/common.py +++ b/prolog/problems/lists/conc_3/common.py @@ -88,7 +88,7 @@ def hint(code, aux_code): # inserting first list's head into the second list in recursive call: conc(T, [H\L2], L) if prolog.engine.ask_truthTO(engine_id, - 'conc([a,b,c,d,e], [1,2,3,4], L = [e,d,c,b,a,1,2,3,4])'): + 'conc([a,b,c,d,e], [1,2,3,4], [e,d,c,b,a,1,2,3,4])'): return [{'id': 'insertion_into_second_list'}] # forcing result onto recursion; case of conc(T, L2, [H|L]) |