diff options
Diffstat (limited to 'prolog/problems/lists/dup_2/common.py')
| -rw-r--r-- | prolog/problems/lists/dup_2/common.py | 44 |
1 files changed, 21 insertions, 23 deletions
diff --git a/prolog/problems/lists/dup_2/common.py b/prolog/problems/lists/dup_2/common.py index a27eb4b..0ed3914 100644 --- a/prolog/problems/lists/dup_2/common.py +++ b/prolog/problems/lists/dup_2/common.py @@ -24,11 +24,10 @@ hint_type = { 'predicate_always_false': Hint('predicate_always_false'), 'base_case': Hint('base_case'), 'timeout': Hint('timeout'), - 'lost_heads': Hint('lost_heads'), 'recursive_case': Hint('recursive_case'), - 'leading_heads_all_x': Hint('leading_heads_all_x'), - 'ins_results_in_empty_list': Hint('ins_results_in_empty_list'), - 'ins_results_in_arbitrary_result': Hint('ins_results_in_arbitrary_result'), + 'forcing_result_onto_recursion': Hint('forcing_result_onto_recursion'), + 'base_case_arbitrary': Hint('base_case_arbitrary'), + 'base_case_missing_[]': Hint('base_case_missing_[]'), } test_cases = [ @@ -78,35 +77,34 @@ def hint(code, aux_code): # recursion is getting bigger and bigger - # inserting an element succeeds with an emtpy list result - if prolog.engine.ask_truthTO(engine_id, 'insert(_, _, [])'): - return [{'id': 'ins_results_in_empty_list'}] + # forcing result onto recursion; case of dup(T, [H,H|L]) or dup(T, [H,H|T]) + if not prolog.engine.ask_truthTO(engine_id, 'dup([a,b,c,d,e], _)') and \ + (prolog.engine.ask_truth(engine_id, + 'asserta( dup([b], [a,a,yowza]) ), dup([a,b], [yowza]), retract( dup([b], [a,a,yowza]) )') or \ + prolog.engine.ask_truth(engine_id, + 'asserta( dup([b], [a,a,b]) ), dup([a,b], [b]), retract( dup([b], [a,a,b]) )')): + return [{'id': 'forcing_result_onto_recursion'}] - # inserting an element succeeds with an arbitrary result - if prolog.engine.ask_truth(engine_id, 'insert(_, _, L), var(L)'): - return [{'id': 'ins_results_in_arbitrary_result'}] + + # base case succeeds with arbitrary result + if prolog.engine.ask_truthTO(engine_id, 'dup([], L), var(L)'): + return [{'id': 'base_case_arbitrary'}] + + # base case does not work for empty list + if prolog.engine.ask_truthTO(engine_id, 'dup([q], [q,q]), \+ dup([], [])'): + return [{'id': 'base_case_missing_[]'}] # missing/failed base case - if not prolog.engine.ask_one(engine_id, 'insert(qQ, [qa,qb,qc], [qQ,qa,qb,qc])'): + if not prolog.engine.ask_one(engine_id, 'dup([], [])'): return [{'id': 'base_case'}] # target predicate seems to always be false - if not prolog.engine.ask_truth(engine_id, 'insert(_, [_,_,_,_,_,_], _)'): + if not prolog.engine.ask_truth(engine_id, 'dup([_,_,_], _)'): return [{'id': 'predicate_always_false'}] - # forgot to put list head(s) back in the list when deleting an element - if prolog.engine.ask_truth(engine_id, 'insert(q, [a,b,c,d,x,y,z], [q,x,y,z])'): - return [{'id': 'lost_heads'}] - - # used [X|T] instead of more general [H|T] in recursive case - if prolog.engine.ask_truth(engine_id, \ - 'findall(NL, insert(q, [a,b,c], NL), [[q,a,b,c], [q,q,b,c], [q,q,q,c], [q,q,q,q]]).') and \ - not prolog.engine.ask_truth(engine_id, 'insert(q, [a,b,c,x,y,z], [a,b,c,q,x,y,z])'): - return [{'id': 'leading_heads_all_x'}] - # base case works, the recursive doesn't (but it doesn't timeout) # this may be left as the last, most generic hint - if not prolog.engine.ask_truth(engine_id, 'insert(qQ, [qa,qb,qc], [qa,qb,qQ,qc])'): + if not prolog.engine.ask_truth(engine_id, 'dup([qa,qb,qc], [qa,qa,qb,qb,qc,qc])'): return [{'id': 'recursive_case'}] |