SWI-Prolog_examples

Some solutions of popular tasks implemented in SWI-Prolog

1. Factorial and Fibonacci number

   Calculation factorial and Fibonacci number using SWI-Prolog in two ways: simple recursion and tail recursion. Examples of usage:

• simple factorial: factor(6,X).
• 'tail' factorial: tailFactor(6,X).
• simple Fibonacci: fibonacci(8,X).
• 'tail' Fibonacci: tailFibonacci(8,V1,V).

2. Knight's tour

   This task is solved using Warnsdorff's rule. Examples of usage:

• horse(8).
• horse(20).

3. Wolf, goat and cabbage problem

   This task is solved through сyclical transition between states. Example of usage:

• condition(left,left,left,left,none).

4. Tower of Hanoi

   This task is solved in "classic" recursive way for 3 towers and using Frame–Stewart algorithm for more towers. Examples of usage:

• mov(3,x,y,z,p).
• mov(3, a,[b,c],d,p).

5. List's operations

   Implemented some operations to show how list works in Prolog's environment. Examples of usage:

• print_list([1,2,3,4]).
• concat_list([1,2],[3,4],N).
• delete_list(1,[1,2,3],[],N).
• member_list(1,[1,2,3]).
• reverse_list([1,2,3],[],N).
• split_list(3,[1,2,3,4,5,6,7,1,1,3],L1,L2).
• insert_head_list(3,[4,5],N).
• insert_back_list([1,2],3,N).
• insert_list([1,2],3,1,N).

6. Eight queens puzzle

   This task is solved through сyclical transition between states. Example of usage:

• ferzi(A).

7. Math puzzle

   Simple school task is solved using brute-force for every digit number. Examples of usage:

• task1(N1,N2,N),add(N1,N2,N).
• task2(N1,N2,N),add(N1,N2,N).