Moderator: Cartographers
yeti_c wrote:Ignore that - I was wrong...
It's 116280 different combinations...
That's
N! / (R-N)!
where N = set size & R = number to choose...
I think this is the correct formula!? But I've gone crosseyed now!
C.
mibi wrote:yeti_c wrote:Hmmm - the problem is the requirement to have the leader...
I was thinking about just writing it out the old school way - but unless I'm mistaken - I make 496 different combinations of 2 guards!!
C.
so both the gang and guard bonus will be a problem?
ghostlygirl wrote:mibi wrote:yeti_c wrote:Hmmm - the problem is the requirement to have the leader...
I was thinking about just writing it out the old school way - but unless I'm mistaken - I make 496 different combinations of 2 guards!!
C.
so both the gang and guard bonus will be a problem?
when i first read this, (your reply),
i thought it said "gang bang"..
and i giggled.
yeti_c wrote:Do you know what - I'm thinking that it might be safer if I write a Java program to put together your combinations for you and output it into XML...
Annoyingly I'm not 100% sure I've got the time to do it...
If I do write one though I will make it easily configurable...
Then we can reuse it for future XML combination generation.
C.
XML removed as too big - Coleman send me a PM with your email address if you want copies of all combos for 2+ for the guards
Users browsing this forum: No registered users