HInts for Prolog Dice sum

[isaacasimov]

Hi,
I was wondering if anybody can help me with this problem that I would like to solve. I just need some advices on how to start.
Given N dice (thus N lists of [1,2,3,4,5]) I need to find the possible combinations that give as result another number.
Example:
dice(P, N, L) where P is the number we want, N the number of dice and L the list
dice (5, 2, L)
L = [1, 4]
L = [2, 3]
L = [3, 2]
L = [4, 1]

I don't know if recursion is what I need here or not. I just need a clue, I really want to try and solve this problem by myself.

Greetings from Vaduz, Lichtenstein

 

[joel76]

It can be done with recursion : dice(5, 2, L) = dice(4, 1, [1|L1]).
You can use a helper predicate

dice(P, N, L) :-
  dice_h(P, N, [], L).

the search succeeds when you reach
dice(0, 0, L, L).