Random Numbers and Sums

Math and Physics Programming

Started by pallo September 25, 2004 10:35 AM

12 comments, last by GameDev.net 19 years, 7 months ago

864

September 26, 2004 06:31 PM

Quote:Original post by Krumble
Perhaps I'm misunderstanding the problem, but consider this:

Given 8 numbers between 1 and 16, the maximum sum you can obtain is 16*8 = 128 and the minimum you can obtain is 1*8 = 8. When you choose your first number, this range [8, 128] is going to change.

Krumble, I believe the assumption is that you are sampling without replacement.

Timkin

pallo

122

Author

September 27, 2004 05:11 AM

Quote:Original post by Timkin

Personally, I'd just store the brute force solution and perform a tree lookup.

This tree would be 16^8 leaves right? That's 42 billion ish....

I'm porting a flash version to palm and pocket/pc as well so I'd like something with a small memory footprint..

Cheers,
Paul

Anonymous

September 27, 2004 06:30 AM

No, not 16^8.

16!/8! == 5.18918400 x 10^8

Anonymous

September 27, 2004 06:37 AM

Pallo, if storing the 12000+ entries takes too much space and calculating them as needed takes too much time, you could settle somewhere in between. Store the first few moves in a table and make a brute force search for the rest.

Random Numbers and Sums

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

Random Numbers and Sums

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

Reticulating splines