×
INTELLIGENT WORK FORUMS
FOR COMPUTER PROFESSIONALS

Are you a
Computer / IT professional?
Join Tek-Tips Forums!
• Talk With Other Members
• Be Notified Of Responses
• Keyword Search
Favorite Forums
• Automated Signatures
• Best Of All, It's Free!

*Tek-Tips's functionality depends on members receiving e-mail. By joining you are opting in to receive e-mail.

#### Posting Guidelines

Promoting, selling, recruiting, coursework and thesis posting is forbidden.

# HInts for Prolog Dice sum

## HInts for Prolog Dice sum

(OP)
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.

### RE: HInts for Prolog Dice sum

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

#### CODE

dice(P, N, L) :-
dice_h(P, N, [], L).
the search succeeds when you reach
dice(0, 0, L, L).

#### Red Flag This Post

Please let us know here why this post is inappropriate. Reasons such as off-topic, duplicates, flames, illegal, vulgar, or students posting their homework.

#### Red Flag Submitted

Thank you for helping keep Tek-Tips Forums free from inappropriate posts.
The Tek-Tips staff will check this out and take appropriate action.

Close Box

# Join Tek-Tips® Today!

Join your peers on the Internet's largest technical computer professional community.
It's easy to join and it's free.

Here's Why Members Love Tek-Tips Forums:

• Talk To Other Members
• Notification Of Responses To Questions
• Favorite Forums One Click Access
• Keyword Search Of All Posts, And More...

Register now while it's still free!