Example Money

Jan Burse, created Sep 15. 2018
* Prolog code for the backtracking example.
* Puzzle originally published July 1924 issue of
* Strand Magazine by Henry Dudeney
* Warranty & Liability
* To the extent permitted by applicable law and unless explicitly
* otherwise agreed upon, XLOG Technologies GmbH makes no warranties
* regarding the provided information. XLOG Technologies GmbH assumes
* no liability that any problems might be solved with the information
* provided by XLOG Technologies GmbH.
* Rights & License
* All industrial property rights regarding the information - copyright
* and patent rights in particular - are the sole property of XLOG
* Technologies GmbH. If the company was not the originator of some
* excerpts, XLOG Technologies GmbH has at least obtained the right to
* reproduce, change and translate the information.
* Reproduction is restricted to the whole unaltered document. Reproduction
* of the information is only allowed for non-commercial uses. Selling,
* giving away or letting of the execution of the library is prohibited.
* The library can be distributed as part of your applications and libraries
* for execution provided this comment remains unchanged.
* Restrictions
* Only to be distributed with programs that add significant and primary
* functionality to the library. Not to be distributed with additional
* software intended to replace any components of the library.
* Trademarks
* Jekejeke is a registered trademark of XLOG Technologies GmbH.
% oneof(+List,-Elem,-List)
oneof([X|Y], X, Y).
oneof([X|Y], Z, [X|T]) :-
oneof(Y, Z, T).
% assign(-List,+List)
assign([], _).
assign([X|Y], L) :-
oneof(L, X, R),
assign(Y, R).
% puzzle(-List)
X = [S,E,N,D,M,O,R,Y],
assign(X, [0,1,2,3,4,5,6,7,8,9]),
M =\= 0,
S =\= 0,
1000*S+100*E+10*N+D+1000*M+100*O+10*R+E =:= 10000*M+1000*O+100*N+10*E+Y.