Quote from: 3Nine on Today at 12:10:34 PM
This is so MR-like; no?
If anything, this is a demonstration of Pigeon Hole Principle par excellence. Instead of waiting for 37 unique numbers to show and then not knowing which one will repeat, we know that a repeat will come by around 24 uniques max; therefore, the event comes quicker than expected - just not quick enough to keep below the table limits. However, by monitoring several simultaneous streams we can arrive at the first repeat quicker than ever.
You admire my efforts yet you undermine them at the same time with rhetorical statements like the above; if I've gone astray then why not be helpful and put me back on the right course? Of all the many hints coming from 3Nine, ati, RMore, Scarface (and others) there's never been a single eureka moment.
https://www.youtube.com/watch?v=Gpmi7dBet0c
All this progress is entirely thanks to my own exhaustive testing based on nothing more than a seed planted by Priyanka through his initial disclosure of the Cycles framework together with it's collection of constants. I would also like to thank my friend from NY for inspiring motivation, ideas and regular discussion amidst all the smoke and mirrors.
Cycles is the main concept that Priyanka shared - and it can work without VdW. Most of the other concepts were addressed on the previous page - mostly a package of mini-concepts, such as entry point, but all with one aim in mind: finding impact. Tracking multiple repeats (= less dozens)... but that strategy is secondary to winning the first repeat, at least. That just leaves stitching bets - you know how I feel about that in terms of it's ambiguity - and finally: deficit recovery.
Deficit Recovery describes that in 10 dozen cycles we expect around 5 CL2s, 3 CL1s and 2 CL3s. If one has fallen behind then we expect it to recover - particular for CL2 (king of dozen cycle lengths). Well, my previous reply above describing (immediate) triple combi repeats just happens to be the perfect example of deficit recovery - using PHP!
CL100 o100 d001>>>CL101 o200 d002
CL001 o100 d001>>>CL101 o200 d002
Above we start with CL1 = 1 (first cycle of row 1) vs. CL3 = 1 (first cycle of row 2). Both recover as CL101 (= CL1 and CL3 both being equal) through an additional push towards being defined the same. So rather than trying to play for CL1 or CL3 to catch up, we simply play for repeats. So not only does this application of PHP take advantage of defined by same - not to mention speedy first repeats - but with it's many forces at work it also takes sound care of deficit recovery.
Continue reading...
Falkor, I admire your efforts but you may want to start fresh from the beginning.
Good luck.
But what more could we possibly want than immediate advantage of "defined by same" and a guaranteed repeat on the very next cycle...?
Good luck.
If anything, this is a demonstration of Pigeon Hole Principle par excellence. Instead of waiting for 37 unique numbers to show and then not knowing which one will repeat, we know that a repeat will come by around 24 uniques max; therefore, the event comes quicker than expected - just not quick enough to keep below the table limits. However, by monitoring several simultaneous streams we can arrive at the first repeat quicker than ever.
You admire my efforts yet you undermine them at the same time with rhetorical statements like the above; if I've gone astray then why not be helpful and put me back on the right course? Of all the many hints coming from 3Nine, ati, RMore, Scarface (and others) there's never been a single eureka moment.
https://www.youtube.com/watch?v=Gpmi7dBet0c
All this progress is entirely thanks to my own exhaustive testing based on nothing more than a seed planted by Priyanka through his initial disclosure of the Cycles framework together with it's collection of constants. I would also like to thank my friend from NY for inspiring motivation, ideas and regular discussion amidst all the smoke and mirrors.
Cycles is the main concept that Priyanka shared - and it can work without VdW. Most of the other concepts were addressed on the previous page - mostly a package of mini-concepts, such as entry point, but all with one aim in mind: finding impact. Tracking multiple repeats (= less dozens)... but that strategy is secondary to winning the first repeat, at least. That just leaves stitching bets - you know how I feel about that in terms of it's ambiguity - and finally: deficit recovery.
Deficit Recovery describes that in 10 dozen cycles we expect around 5 CL2s, 3 CL1s and 2 CL3s. If one has fallen behind then we expect it to recover - particular for CL2 (king of dozen cycle lengths). Well, my previous reply above describing (immediate) triple combi repeats just happens to be the perfect example of deficit recovery - using PHP!
CL100 o100 d001>>>CL101 o200 d002
CL001 o100 d001>>>CL101 o200 d002
Above we start with CL1 = 1 (first cycle of row 1) vs. CL3 = 1 (first cycle of row 2). Both recover as CL101 (= CL1 and CL3 both being equal) through an additional push towards being defined the same. So rather than trying to play for CL1 or CL3 to catch up, we simply play for repeats. So not only does this application of PHP take advantage of defined by same - not to mention speedy first repeats - but with it's many forces at work it also takes sound care of deficit recovery.
Continue reading...