c  go  java  js  lua  py  vbs  rkt  scm  pro  

For installation and use of TuProlog, see tuprolog .

TuProlog can be used in interactive mode and also to run Prolog scripts in a batch-oriented way. For more info, see the TuProlog manual (in PDF form).

The following command can be used to experiment with the interactive Prolog shell using TuProlog.

Note: This assumes that Java is installed and that TuProlog is installed in the users home directory under the bin folder.

Here is the Prolog code.
prints([]):- nl. prints([X|Rest]):- print(X), prints(Rest). go:- print("Hello world!"), nl. :- solve(go).
Here is the output of the Prolog code.
Hello world!

Here is the Prolog code.
prints([]):- nl. prints([X|Rest]):- print(X), prints(Rest). move(0,_,_,_). move(N1,A1,B1,C1):- N2 is N1 - 1, move(N2,A1,C1,B1), prints(['move ',N1,' from ',A1,' to ',B1,'\n']), move(N2,C1,B1,A1). go:- move(5,'a','b','c'). :- solve(go).
Here is the output of the Prolog code.
move 1 from a to b\n move 2 from a to c\n move 1 from b to c\n move 3 from a to b\n move 1 from c to a\n move 2 from c to b\n move 1 from a to b\n move 4 from a to c\n move 1 from b to c\n move 2 from b to a\n move 1 from c to a\n move 3 from b to c\n move 1 from a to b\n move 2 from a to c\n move 1 from b to c\n move 5 from a to b\n move 1 from c to a\n move 2 from c to b\n move 1 from a to b\n move 3 from c to a\n move 1 from b to c\n move 2 from b to a\n move 1 from c to a\n move 4 from c to b\n move 1 from a to b\n move 2 from a to c\n move 1 from b to c\n move 3 from a to b\n move 1 from c to a\n move 2 from c to b\n move 1 from a to b\n

Prolog can be used to solve puzzles involving permutations and combinations.

The following does a selection allowing repetition.

Here is the Prolog code.
prints([]):- nl. prints([X|Rest]):- print(X), prints(Rest). v(1). v(2). v(3). go:- v(A), v(B), v(C), prints(['A=',A,' B=',B,' C=',C,'\n']), fail. :- solve(go).
The number of selections with repetition of n objects is n to the power of n. For n = 3 this is 3*3*3 = 27.

Here is the output of the Prolog code.
A=1 B=1 C=1\n A=1 B=1 C=2\n A=1 B=1 C=3\n A=1 B=2 C=1\n A=1 B=2 C=2\n A=1 B=2 C=3\n A=1 B=3 C=1\n A=1 B=3 C=2\n A=1 B=3 C=3\n A=2 B=1 C=1\n A=2 B=1 C=2\n A=2 B=1 C=3\n A=2 B=2 C=1\n A=2 B=2 C=2\n A=2 B=2 C=3\n A=2 B=3 C=1\n A=2 B=3 C=2\n A=2 B=3 C=3\n A=3 B=1 C=1\n A=3 B=1 C=2\n A=3 B=1 C=3\n A=3 B=2 C=1\n A=3 B=2 C=2\n A=3 B=2 C=3\n A=3 B=3 C=1\n A=3 B=3 C=2\n A=3 B=3 C=3\n

A permutation is a selection from a set without repetitions allowed and where order is important.

Here is the Prolog code.
prints([]):- nl. prints([X|Rest]):- print(X), prints(Rest). v(1). v(2). v(3). dif(X,Y):- X \= Y. go:- v(A), v(B), dif(B,A), v(C), dif(C,B), dif(C,A), prints(['A=',A,' B=',B,' C=',C,'\n']), fail. :- solve(go).
The number of permutations of n objects is n! (n factorial). For n = 3 this is 3*2*1 = 6.

Here is the output of the Prolog code.
A=1 B=2 C=3\n A=1 B=3 C=2\n A=2 B=1 C=3\n A=2 B=3 C=1\n A=3 B=1 C=2\n A=3 B=2 C=1\n