So right now there are allot of different ships and combinations for 95-100 points. What I want to know is how many combinations. I think Imperial will be easier to figure out then rebels.

right now for imperials, you have 48 different pilots

29 of them are unique

18 of which can take an EPT (however 3 non uniquie can bring EPT)

18 EPTs (1 unique)

all ships can be modified with 6 different loadouts (however intercepters can take 2) what makes this even more confusing is you would never have a munition failsafe on any one who is not packing a missile.

oh and if you decided to pack a double bounty hunter, only 1 of them could choose to have 1 of 3 choices.

I havent even gotten into all the ships that can load missiles, crew, bombs, or sensors.I realize at this point, it is near impossible to do without a computer, so I wonder, does anyone have a program that can crunch these calculations?

To make things interesting, if anyone is able to do these calculations (and able to show the math) I will send a ship of their choice to (us only)

It is theoretically possible to calculate, but it would be impossible to generate any kind of human-readable formula. You've got an huge amount of ships, each of which can take from a different pool of upgrades, restrictions on taking more than one copy of unique upgrades, a rule that useless upgrades (failsafes on ships with no missiles, targeting computers on x-wings, etc) are not allowed, and you don't even know how many ships you're going to have. Someone could probably show you a number if they really want that $15 ship, but what you're going to get is a matlab script that adds it all up, not a nice bit of math that you can look at and say "oh, I get it".

Anyway, how you would do it:

SHIPS = every unique combination of ship + upgrades: {rookie, rookie + r2, rookie + r2 + torp, rookie + r5, rookie + r5 + torp, ...}, in increasing order of point cost for convenience.

SHIPS(X) = the Xth ship in SHIPS, or {NULL} if the Xth ship is over the point limit.

Z = number of items in SHIPS.

E(x = a:b)[stuff] = sum of [stuff] where x = a to b (since I can't draw the appropriate symbol in text form).

Total number of lists = E(X=1:Z)[sHIPS(X) + E(Y=1:Z)[sHIPS(Y)] ... ]

I've probably misplaced a bracket in there somewhere, but essentially what you do is run a recursive sum that picks ship #1 in the list, then picks ship #2 out of the remaining points, etc, until all points are spent. Then that is recorded as one list, and it tries the next ship #2, spends all of its points, and records that as the second list. This continues until all options for ship #2+ have been tried, and then moves to the next ship in the list for ship #1.

Needless to say this is stupidly complicated and if you want to get a final answer you're going to need to pay more than a $15 ship.

I already realized the complication behind this.
I was thinking it might be possible to do on an excel sheet if you get the possibilities of every single ship, then duplicate 4x for anything that is 25-32 points , and 3x for anything that is 33-49 points... then figure out how many of those can fit into the 95-100 range (which you would have to do at 100 points, 99 points, 98 points, 97 points... but once you get the first portion, it should be easy)

you can even skip steps just by looking at how many of each EPT cost A, B, C, or D points (1-4) then adding Ship 1+A (five times)

Ship 1+B (six times)

Ship 1+C (five times)

Ship 1+D (two times)

again the complication for me behind this is things like squad leader, droids, slave 1 (this one really does a doozy for me)

then duplicate 4x for anything that is 25-32 points , and 3x for anything that is 33-49 points...

Except that just gives you lists that are 3-4 copies of the same ship. Let's use 50 point lists just for simplicity. Your method gives you:

Rookie + torp

Rookie + torp

Rookie + shield upgrade

Rookie + shield upgrade

etc

But you're missing all the lists like this:

Rookie + torp

Rookie + shield upgrade

Rookie + torp + R2

Rookie + hull upgrade

Rookie + torp + R5 + failsafe

Rookie + R7

Rookie + R2

Rookie

7 point initiative bid

Rookie + R2D2

Bandit

Bandit

etc

And you can't just assume that any combination of two rookies is a list (as you'd get if you just copy the lists) since that doesn't account for unique upgrades or going over on points with certain combinations (like you would with rookie + torp + hull upgrade and rookie + shield upgrade, even though both of those ships appear in legal lists).

then duplicate 4x for anything that is 25-32 points , and 3x for anything that is 33-49 points...

Except that just gives you lists that are 3-4 copies of the same ship. Let's use 50 point lists just for simplicity. Your method gives you:

Rookie + torp

Rookie + torp

Rookie + shield upgrade

Rookie + shield upgrade

etc

But you're missing all the lists like this:

Rookie + torp

Rookie + shield upgrade

Rookie + torp + R2

Rookie + hull upgrade

Rookie + torp + R5 + failsafe

Rookie + R7

Rookie + R2

Rookie

7 point initiative bid

Rookie + R2D2

Bandit

Bandit

etc

And you can't just assume that any combination of two rookies is a list (as you'd get if you just copy the lists) since that doesn't account for unique upgrades or going over on points with certain combinations (like you would with rookie + torp + hull upgrade and rookie + shield upgrade, even though both of those ships appear in legal lists).

I think I see what you thought I meant. though I wasnt missing any lists, I was infact creating duplicate lists.

I assumed that if you could throw in a duplicate ship as a unique number but you are going to get rookie+r2 rookie+r2 rookie+r5 rookie+r5 multiple times... Im sure there is a simple forumula that will take care of that though

I doubt I got all the numbers right, but there should be a way to simplify something like this.... (pulls out a magic phone to call Khyros)

I doubt I got all the numbers right, but there should be a way to simplify something like this....

No, there is no way to simplify it because what you're asking for is incredibly complicated. Your list of number combinations has two problems:

1) There are way more than four options. There are 12,870 possible ways to build an x-wing, and that's assuming you never use failsafes or put EPTs on anyone with the EPT droid. Assuming all seven small-base ships have a similar level of options and you build a three-ship list there are about 730 billion possible lists. In reality that number is a lot bigger, since x-wings have relatively few upgrade options. For example, Ten Numb alone has over 50,000 possible configurations.

2) You're not limited to four choices. You could have anywhere between one and eight ships, depending on which choices you make. So you have to cover all the possible combinations of 1-8 of those hundreds of thousands of possible ships, excluding all of the combinations that are over 100 points, use duplicate unique cards, etc.

In short, we're quickly getting into the range where the number of possible X-Wing lists is so absurdly huge that the exact number doesn't matter.

Imperials - 989,824,245,271

Rebel - 1,027,383,419,725

I'll take a falcon. I'll PM you my address.

Imperials - 989,824,245,271

Rebel - 1,027,383,419,725

I'll take a falcon. I'll PM you my address.

Numbers too small.

Sentence too small. -50 DKP.

Can't blame a guy for trying..

I actually opened up MATLAB to try and work this out but quickly realized it was way more effort than I wanted to put forth.

I figured it was going to be something only a really really dedicated person could work out lol

One single ship is not worth the hassle.

One single ship is not worth the hassle.

But there are already people who do stuff like this ..... just because. Have you SEEN the alphabetized Star Wars?

One single ship is not worth the hassle.

But there are already people who do stuff like this ..... just because. Have you SEEN the alphabetized Star Wars?

I'm still waiting for that version of the prequels, they might make more sense that way....

on topic, someone who has already a squad builder should have it easier since he has the data in digital form. Since some also have a random squad gen, that algorithm shouldn't be that far from the objective, just^*) take the random out of it, generate all lists instead of one and count the instances.

*) I know, "just" is a variable in software development it has a range of work done in a few minutes to a few weeks (or in certain cases impossible)

Imperials - 989,824,245,271

Rebel - 1,027,383,419,725

I'll take a falcon. I'll PM you my address.

Why not at tantive!

I don't know why you'd want, or need to know anything more exact than an estimate. Even then it's tough, as you've really complicated things by implying you don't want pointless builds, (munitions failsafe without a missile). And even more by giving a variable point building size 95-100

Consider deadeye on a hwk with a tactician, targeting computer and no turret..... The double EPT's on awings alone push the number to half a million. Maybe someone will claim your ship, but it's a lot of work for what honestly dosn't tell us very much about the game we don't already know.

One single ship is not worth the hassle.

But there are already people who do stuff like this ..... just because. Have you SEEN the alphabetized Star Wars?

YES.

Honestly though, it's just a matter of finding combinations for specific ships and adding them together. How many EPTs are there? TIE Fighters would be easy. There's Academies, Obsidians, Black, Black*EPT, and the same for whatever pilots. Get total, move to next ship. It's just a lot of data to keep track of, and with lots of upgrades or multiples of the same upgrade, it gets a bit harder

Not so simple, because we're building lists and keeping track of point totals - not just possible build options for a single ship.

The bomber alone must have a ridiculous number of random configurations, due to the permutation of ordinance you can get.... must be some ridiculous number in total. I'd guess easily over a trillion combinations of a 100 point list.

This problem is similar to the subset sum problem https://en.wikipedia.org/wiki/Subset_sum_problem -- which is NP complete. i.e. there is no known algorithm to solve this problem in linear time (i.e. the amount of time it will take grows exponentially with the number of upgrades and pilots).

The subset sum problem:

given a set of integers (i.e. the point costs associated with each pilot and each upgrade) and an integer s (e.g.. 100 points), does any non-empty subset (collection of pilots and upgrades) sum to s?

Wow!