The Bot Bikeshed
-
@error_bot eval def withinFifty(x,y) => pow(pow(x,2)+pow(y,2),.5) < 50 ; def split(r,p) => (r > p) ? (r - p) : (0 - r) ; let sample = 100 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinFifty( split(1d100,50) , split(1d100,50) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; ( trial() + trial() + trial() + trial() ) / 4
-
2.97(trial() (2.84) + trial() (3.04) (5.88) + trial() (3.12) (9) + trial() (2.88) (11.88)) / 4 (2.97) = 2.97
-
@error_bot eval def withinFifty(x,y) => pow(pow(x,2)+pow(y,2),.5) < 50 ; def split(r,p) => (r > p) ? (r - p) : (0 - r) ; let sample = 200 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinFifty( split(1d100,50) , split(1d100,50) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; ( trial() + trial() + trial() + trial() ) / 4
-
Error: ttl expired
-
@error_bot eval def withinFifty(x,y) => pow(pow(x,2)+pow(y,2),.5) < 50 ; def split(r,p) => (r > p) ? (r - p) : (0 - r) ; let sample = 666 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinFifty( split(1d100,50) , split(1d100,50) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial()
-
Error: Maximum call stack size exceeded
-
@error_bot eval def withinFifty(x,y) => pow(pow(x,2)+pow(y,2),.5) < 50 ; def split(r,p) => (r > p) ? (r - p) : (0 - r) ; let sample = 333 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinFifty( split(1d100,50) , split(1d100,50) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial()
-
3.111trial() (3.111) = 3.111
-
@error_bot eval def withinFifty(x,y) => pow(pow(x,2)+pow(y,2),.5) < 50 ; def split(r,p) => (r > p) ? (r - p) : (0 - r) ; let sample = 333 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinFifty( split(1d100,50) , split(1d100,50) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial()
-
2.919trial() (2.919) = 2.9193.171trial() (3.171) = 3.171
-
@error_bot eval def withinFifty(x,y) => pow(pow(x,2)+pow(y,2),.5) < 500 ; def split(r,p) => (r > p) ? (r - p) : (0 - r) ; let sample = 333 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinFifty( split(1d1000,50) , split(1d1000,500) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial()
-
1.67trial() (1.67) = 1.671.646trial() (1.646) = 1.646
-
@error_bot eval def withinFifty(x,y) => pow(pow(x,2)+pow(y,2),.5) < 500 ; def split(r,p) => (r > p) ? (r - p) : (0 - r) ; let sample = 333 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinFifty( split(1d1000,500) , split(1d1000,500) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial()
-
2.967trial() (2.967) = 2.9673.087trial() (3.087) = 3.087
-
-
@Gribnit If at first you don't succeed, redefine success.
-
@error said in The Bot Bikeshed:
@Gribnit If at first you don't succeed, redefine success.
I don't know that I haven't succeeded. If I keep testing, I'm likely to find out.
-
@error_bot
roll 5d2r1
roll 5d10r even
roll 3d2R1
roll 4d20r(n lt 5)
-
95d2r1 (2, 2, 2, 2,1, 1: 9) = 9325d10r even (1, 9,6,4,10, 6, 6, 10: 32) = 3263d2R1 (1, 2,1,1, 2,1, 2: 6) = 6364d20r(n lt 5) (9, 6, 5, 16: 36) = 36
-
Lowercase r => reroll from the first set of results; uppercase r => keep rerolling until ttl expires or desired number of dice is achieved.
It can be a number, in which case it will reroll that specific number, a function name (eg
even
,odd
), or an expression wheren
is the number rolled.roll 5d20r(n in ( 2, 4, 7, 10 ))
-
This post is deleted!
-
@error_bot roll 5d20R(n nin ( 2, 4, 7, 10 ))
roll 5d20R(n in ( 2, 4, 7, 10 ))
-
275d20R(n nin(2, 4, 7, 10)) (17,11,17, 4,20,18,5,14,13,9,19,6, 2,19, 10,6,15,11,8, 4,8,18, 7: 27) = 27555d20R(n in(2, 4, 7, 10)) (3, 12, 19, 12, 9: 55) = 55
-
@error_bot roll d100R(n ne 99)
-
Error: Too many rerolls
-
This post is deleted!
-
@error_bot roll d100R(n ne 99)
-
99d100R(n ne 99) (66,61,85,12,77,67,63,74,66,18,58,73,35,63,27,12,35,50,45,89,84,79,36,81,84,18,70,47,76,66,43,39,60,71,82,49,92,47,81,49,3,19,64,51,4,69,71, 99: 99) = 99
-
@error_bot roll 10d20rodd
-
11810d20r odd (16,13,1,15, 12,13, 18, 20,11, 8, 15, 2, 5, 2, 20: 118) = 118
-
@error_bot eval let radius= 50; def withinRadius(x,y) => pow(pow(x,2)+pow(y,2),.5) < radus; def split(r) => (r > radius) ? (r - radius) : (0 - radius) ; let sample = 333 ; def descend(n,s) => (n > 0) ? descend( n - 1 , s + ( withinRadius( split(1d100) , split(1d100) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial()
-
Error: Unknown identifier: radus
-
-
@error_bot eval let radius= 50; def withinRadius(x,y) => pow(pow(x,2)+pow(y,2),.5) < radius; def split(r) => (r > radius) ? (r - radius) : (0 - radius) ; let sample = 333 ; def descend(n,s) => (n > 0) ? descend( n - 1 , s + ( withinRadius( split(1d100) , split(1d100) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial()
-
0.853trial() (0.853) = 0.8530.721trial() (0.721) = 0.721
-
-
@error_bot eval def withinFifty(x,y) => pow(pow(x,2)+pow(y,2),.5) < 50 ; def split(r,p) => (r > p) ? (r - p) : (0 - r) ; let sample = 100 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinFifty( split(1d100,50) , split(1d100,50) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial() ; trial() ; trial()
-
3.04trial() (3.04) = 3.043.44trial() (3.44) = 3.442.96trial() (2.96) = 2.963.24trial() (3.24) = 3.24
-
@error_bot eval let radius = 50 ; def withinRadius(x,y) => pow(pow(x,2)+pow(y,2),.5) < radius ; def split(r) => (r > radius) ? (r - radius) : (0 - radius) ; let sample = 100 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinRadius( split(1d100) , split(1d100) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial() ; trial() ; trial()
-
0.76trial() (0.76) = 0.760.92trial() (0.92) = 0.920.68trial() (0.68) = 0.680.6trial() (0.6) = 0.6
-
@error_bot eval def withinRadius(x,y) => pow(pow(x,2)+pow(y,2),.5) < 50 ; def split(r,p) => (r > p) ? (r - p) : (0 - r) ; let sample = 100 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinRadius( split(1d100,50) , split(1d100,50) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial() ; trial() ; trial()
-
2.8trial() (2.8) = 2.83.44trial() (3.44) = 3.442.96trial() (2.96) = 2.963.16trial() (3.16) = 3.16
-
@error_bot eval let radius = 50 ; def withinRadius(x,y) => pow(pow(x,2)+pow(y,2),.5) < radius ; def split(r,p) => (r > p) ? (r - p) : (0 - r) ; let sample = 100 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinRadius( split(1d100,50) , split(1d100,50) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial() ; trial() ; trial()
-
3.16trial() (3.16) = 3.162.92trial() (2.92) = 2.923.28trial() (3.28) = 3.282.84trial() (2.84) = 2.84
-
@error_bot eval let radius = 50 ; def withinRadius(x,y) => pow(pow(x,2)+pow(y,2),.5) < radius ; def split(r) => (r > radius) ? (r - radius) : (0 - r) ; let sample = 100 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinRadius( split(1d100) , split(1d100) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial() ; trial() ; trial()
-
3.12trial() (3.12) = 3.123.16trial() (3.16) = 3.162.84trial() (2.84) = 2.842.96trial() (2.96) = 2.96
-
@error_bot eval let radius = 50 ; def withinRadius(x,y) => pow(pow(x,2)+pow(y,2),.5) < radius ; def split(r) => (r > radius) ? (r - radius) : (0 - r) ; let sample = 200 ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinRadius( split(1d100) , split(1d100) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial() ; trial()
-
2.94trial() (2.94) = 2.942.76trial() (2.76) = 2.763trial() (3) = 3
-
@error_bot eval let radius = 50 ; def withinRadius(x,y) => pow(pow(x,2)+pow(y,2),.5) < radius ; def split(r) => (r > radius) ? (r - radius) : (0 - r) ; let sample = 6 * radius ; def descend(n,s) => n > 0 ? descend( n - 1 , s + ( withinRadius( split(1d100) , split(1d100) ) ? 1 : 0 ) ) : s ; def trial() => descend(sample, 0) / ( sample / 4 ) ; trial() ; trial() ; trial()
-
Error: ttl expired