Ad:

Python Discussion Thread
Unsolved
Views: 7064

Sep 9th, 2007

Moola Gold Rush Solver

Expand Post »

I am trying to write a program that will help me with Gold Rush...This is a game on moola.com. Gold Rush is the most popular game available for players to wager their winnings on. It involves a series of six blind bids on gold nuggets with various point values. The player with the most points at the end wins the game, and all of the cash wagered. I have created a program that evaluates a game and gives out a winner...but the game needs to be input with the form of 5,3,1,2,4,6,5,6,2,1,3,4,1,6,5,3,2,4 the first six are the gold I play, the middle six are the gold in the being wagered for and the last six are the gold that the other player chooses...so basically my question is what line(s) of code would give me every possible game...like
1,2,3,4,5,6,1,2,3,4,5,6,1,2,3,4,5,6
1,2,3,4,5,6,1,2,3,4,5,6,1,2,3,4,6,5 etc

there are 373 million possible games I believe

Any ideas would be great

Similar Threads

Tell us about yourself! in Community Introductions
Can't get rid of dumphook.exe and Antivirus Gold in Viruses, Spyware and other Nasties
fill a text in gold in Graphics and Multimedia

justmonkey23

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

5 posts
since Jun 2007

Permalink

Sep 9th, 2007

Moola Gold Rush Solver

Or does anyone know how to create a list of all variations of a six digit number that has a single digit range from 1...6 and uses one digit per field...I bet this is very unclear

This is the form
1,2,3,4,5,6
6,5,4,3,2,1
1,3,5,2,4,6
2,4,6,1,3,5

6! would lead me to believe there are 320 variations...

justmonkey23

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

5 posts
since Jun 2007

Permalink

Sep 10th, 2007

Re: Moola Gold Rush Solver

No, it makes sense.

Try this:

Python Syntax (Toggle Plain Text)
def perms(s):
    if len(s) == 0:
        return []
    elif len(s) == 1:
        return [s]
    retval = []
    for x in s:
        base = s[:]
        base.remove(x)
        for tmp in perms(base):
            tmp = [x] + tmp
            retval.append(tmp)
    return retval
 
print perms([])
print perms([1])
print perms(range(1,3))
print perms(range(1,4))
def perms(s):
    if len(s) == 0:
        return []
    elif len(s) == 1:
        return [s]
    retval = []
    for x in s:
        base = s[:]
        base.remove(x)
        for tmp in perms(base):
            tmp = [x] + tmp
            retval.append(tmp)
    return retval

print perms([])
print perms([1])
print perms(range(1,3))
print perms(range(1,4))

Jeff

Last edited by jrcagle; Sep 10th, 2007 at 11:00 pm.

jrcagle

Reputation Points: 92

Solved Threads: 156

Practically a Master Poster

Offline

608 posts
since Jul 2006

Permalink

Sep 10th, 2007

Re: Moola Gold Rush Solver

Wow thanks that was what I needed...Could you do me another favor, please explain what each line means?

justmonkey23

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

5 posts
since Jun 2007

Permalink

Sep 11th, 2007

Re: Moola Gold Rush Solver

Well, the basic algorithm is this:

Python Syntax (Toggle Plain Text)
Run through the set, taking each element in turn.
For each element x, take the *rest* of the set and compute the perms of that subset.
Add element x to each of the sets in the perms.
Return the union of those results.
Run through the set, taking each element in turn.
For each element x, take the *rest* of the set and compute the perms of that subset.
Add element x to each of the sets in the perms.
Return the union of those results.

So for s = [1,2,3], we would have

1 --> compute perms of [2,3]; add to each: [1,2,3], [1,3,2]
2 --> compute perms of [1,3]; add to each: [2,1,3], [2,3,1]
3 --> compute perms of [1,2]; add to each: [3,1,2], [3,2,1]

Then we "add" (really, take the union) of each set of results above.

The first four lines compute the base cases. The rest of the lines perform the recursive algorithm above.

Hope it helps,
Jeff

jrcagle

Reputation Points: 92

Solved Threads: 156

Practically a Master Poster

Offline

608 posts
since Jul 2006

Permalink

Jul 7th, 2009

Re: Moola Gold Rush Solver

Great script. The format is indeed useful.

SNIP

Last edited by happygeek; Jul 7th, 2009 at 7:55 am. Reason: fake sig snipped - no advertising

jem777

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

2 posts
since Jul 2009

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in Python Forum Timeline: Accessing system resources

Next Thread in Python Forum Timeline: Metadata in XML with Python

DaniWeb Message

Cancel Changes

User Name
Password