User blog comment:SmartAlyx/Breeding THEORY & Algorithm Analysis/@comment-28259418-20170208160406

777Xenon... "Interesting. I definitely like how you use your formula. I think that'll be of great help to a lot of players. IMHO 14 hrs is the limit before I start to groan at breeding timers, but that's just me."

SmartAlyx... MATH MENSCHES:  When faced w/ mathematical gymnastics complex enough to require stretching for inevitable leaps in logic over cube roots sprouting from a Vedanta Tree & through flaming Removable Discontinuity Holes, I would rather volunteer for an unmedicated root canal @ an odontology college. For those who enjoy exercising "moving numbers" (ie:  figuring how Boosts reduce time...) & can actually make them line up & perform on command, I doff my hat in your general direction. Would you consider becoming a resource? My math mensch? To consult on occasion?

That being said, it should be no surprise to learn that I agonized on the work necessary for a Muggle such as myself to grasp & perform the math wizardry vital to creating an equation that contends w/ the potential of chances of chance! Actually having the probable (but NOT certain!) chances of one thing happening affecting the chances of other things happening that in turn have their own chances of happening... They should invent an intellectual epidural for folks not accustomed to the agony of mathematical creation. I am sure my Algorithm exists elsewhere. I just know so little that I had no idea how to phrase questions that might lead me to it. Oy vay! It's a wonder I succeeded at all! & looking over my Algorithm, I THINK i have a way to make it easier to read.

Current Algorithm: {[C(c1)] + [R(r1)] + [SR(sr1)] + [UR(ur1)]}

C, R, SR, & UR are all CONSTANTS, meaning they do not change, ever. (Unless you decide you want them too!  ;)  I think it makes sense to write them to reflect:  "CONSTANT Commons" = Cc. "CONSTANT Rares" = Cr...

c1, r1, sr1, & ur1 are all VARIABLES because each time you plug in the tabulated results of a different Breeding Pair there will, the majority of time, be differences (slight to significant) in the number & names of dragon Fails possible. So when counting the dragon Fails they change, so are VARIABLE. I think it makes sense to write:  "VARIABLE Commons" = Vc. "VARIABLE Rares" = Vr...

Current Algorithm: {[C(c1)] + [R(r1)] + [SR(sr1)] + [UR(ur1)]}

Rewritten Algorithm: {[Cc(Vc)] + [Cr(Vr)] + [Csr(Vsr)] + [Cur(Vur)]}

What do you think? My ultimate goal it to make this Algorithm as user friendly as possible.

One cool aspect of my Algorithm is that it is malleable;  parameters can be altered to reflect the users preferences. If you disagree w/ how I arbitrarily delineated the CONSTANTS:  (C = 60%  /  R = 30%  /  SR = 9%  /  UR = 1%) then change it to your liking & plug them in to the Algorithm. Same goes w/ the VARIABLES. If you want to slide the cut off between acceptable Fails down (from my arbitrary 12h to say 10h) or up (12h to 14h) it just means you count the VARIABLE dragon Fails differently then plug the fraction into the Algorithm. Easy peezy. Just be sure to make it clear when Posting results:  "Chances of Breeding a Fail of 10h or longer = [#%]."