@Zari

Your seed formula,

only ranges from 0 to 0.9999...

So I'm assuming that this is supposed to be multiplied by 65536 to account for the entire range of seeds?

I just need to be absolutely certain of every formula because I am trying my hardest to whip up a program that calculates necessary combos of T and n.

Edit: Idea.

Above I explained how I found good seeds with RNG Reporter, and I assume that's how Zari found that amazing Hasty spread. However, this takes tons of time because we're working off of a program that's capable of calculating 2^32 - 1 seeds (am I right?). The method I used was really clunky. It required working around DPPt seed generation techniques (date, time, delay, frame, etc.) to find good spreads, whose seeds we ended up plugging into Neosyrex's program anyways (and most of them that I found were valid). Therefore we know that most spreads are available in FRLG, which only has 2^16 - 1 seeds (again, am I right?). It would be much easier to write a program that finds ONLY compatible FRLG spreads. It prompts for Method; Nature; Min, Max, or Exact HP,Atk,Def,SpA,SpD,Spe; max hour(indefinite); max minute (0-59); Then it loops through from seeds 0 to 65535 and finds spreads that occur within the given time constraints and outputs each matching seed. It will display the seed, the frame number, hours, minutes, and seconds, nature, IV's for that particular spread.

Code:

prompt Method (1,2,4)? --> int method;
prompt Nature (-1 for any) --> int nature;
prompt Max (2), Min (1), or any (0) HP constraint --> int HPConst; /*this allows you to search for a minimum HP stat (say, 30) if you enter 1, or exact (31) if you enter 0, etc. etc. */
prompt HP --> int HP;
prompt Attack Constraint --> int AtkConst;
prompt Atk --> int Atk;
prompt Def Constraint --> int DefConst;
...
prompt Spe Constraint --> int SpeConst;
prompt Spe --> Spe;
prompt max hour --> int maxHour;
prompt max minute --> int maxMinute;
prompt max second --> int maxSecond;
/* Here are our constants */
int i;
int maxSeed = 65535;
/*get time*/
int maxTime = 3600*maxHour + 60*maxMinute + maxSecond; //in seconds
/*brute force*/
for (i=0; i<=maxSeed; i++) {
/* insert code to check every seed, i, and get the PID, iv's, etc..
then output all of these values, including gender and ability */
}