Anonymous user
Pascal's triangle/Puzzle: Difference between revisions
→{{header|Prolog}}: shorter version that can also be more easily extended with additional triangle lines if required
No edit summary |
(→{{header|Prolog}}: shorter version that can also be more easily extended with additional triangle lines if required) |
||
Line 799:
<lang prolog>:- use_module(library(clpfd)).
puzzle(Ts, X, Y, Z)
Ts = [
[
[
Y #= X + Z, triangle(Ts), append(Ts, Vs), Vs ins 0..sup, label(Vs).
triangle([T|Ts]) :- ( Ts = [N|_] -> triangle_(T, N), triangle(Ts) ; true ).
triangle_([], _).
triangle_([T|Ts], [A,B|Rest]) :- T #= A + B, triangle_(Ts, [B|Rest]).
% ?- puzzle(_,X,Y,Z).
Line 817 ⟶ 816:
% Y = 13,
% Z = 8 ;</lang>
=={{header|PureBasic}}==
Brute force solution.
| |||