> Stephan Schiffel wrote: >> >> ?- hash_create(H), minimize((member(X,[3,2,1]), hash_add(H,solution,X)), X). >> Found a solution with cost 3 >> Found a solution with cost 2 >> Found a solution with cost 1 >> Found no solution with cost -1.0Inf .. 0 >> >> H = hash(4, 0, []) >> X = 1 To get the behaviour you want, use a store that survives backtracking (record, bag, store, shelf), e.g. ?- record_create(H), minimize((member(X, [3, 2, 1]), recordz(H, X)), X), recorded_list(H, Xs). H = 'REC'(16'060c99d0) X = 1 Xs = [3, 2, 1] Yes (0.00s cpu) -- JoachimReceived on Wed Aug 04 2010 - 23:54:41 CEST
This archive was generated by hypermail 2.3.0 : Wed Sep 25 2024 - 15:13:20 CEST