Coding

[atomic7732]

yes but multiply 100 by 100 or 1 by 100

they are different results

[vh]

so apparently the reason my code suddenly got so fast is because i accidentally created a bug which caused the code to actually not do any computations at all but still appear to work and yeah i fixed that and now it's back to not being super fast but still being 2 to 3 times faster than it was before

1 million bodies for ten thousand timesteps should take about a day to compute now

[atomic7732]

it's not done yet

[atomic7732]

so anyway, i calculated musical taste groupings for the 15 eligible past participants of univision

basically what I did was, I compared the votes of every nation with every other nation, and got values for every single pairing (vote similarity + whether both nations vote for each other)

then created an algorithm which would split the nations into 4 groups which internally matched the closest, ignoring the rest of the nations

the result is 4 different musical tastes, or "pots"



if you think you're in the wrong pot, you very well may be, but you likely were sacrificed for someone else who fit better. for example, darvincia fits very well into pot C (Solea, Dotruga, and Blaland are his 1st, 2nd, and 4th most similar nations), and not very well into B (with his 6th, 8th, and 13th)

but the nation that he switched with, Bielosia, fits worse in pot B (10th, 11th, 12th), but about equally as well as Darvincia did in pot C (1st, 2nd, 5th)

this switch increased total affinity by 17 units

this doesn't exactly serve any functional purpose in univision, since we have no semifinals, but it does give a quantified sense of musical tastes and voting similarities

a more detailed chart and calculations that were used to determine this can be found here

[Darvince]

can someone check all ips on wikipedia like contributions for 174.19.xxx.xxx

[FiahOwl]

This message is only viewable with Universe Sandbox Galaxy Edition. Access it and much more with promo-code '165705'.

[blotz]

i think it might make individual pages for each IP so it should be relatively easy.

[atomic7732]

there are contribs pages for every IP that has edited so yes

[Darvince]

fiah there's a reason i asked in the coding thread (hint hint)

[atomic7732]

dar's number criteria thing i coded for him

even numbers not divisible by 10 whose digit sums are primes whose digit sums are prime

http://pastebin.com/dWrnN7VY

example: 14972 (even)

1+4+9+7+2 = 23 (prime)
sum again:
2+3 = 5 (prime)

[blotz]

do you even loop kalassak?
#rekt
http://pastebin.com/xNVqWXcj

[vh]

holyshit, i just discovered this new python built-in today

testing if all values in a list are positive:

old style:

Code: [Select]

false not in [val > 0 for val in lst]
with this built-in:

Code: [Select]

all(val > 0 for val in lst)

[Bla]

I was working on a script that needs to fit a function, which has decided that it wants to contain an integral. I spent more than an hour trying to figure out why many variables, starting with Rg, began to change to ridiculous values after the first turn in the loop. Well, it turns out I used c for the speed of light and forgot that I also trashed a useless matrix element into a variable called 'c' in the loop. gg. Do never use c for anything else than the speed of light.

[vh]

kol bad variable names have cost me many hours of debugging

also when i write physics simulations and i do something like
x_velocity += x_acceleration*t
the copy and paste it, changing x to y to update y_velocity -- but i only change some of the x's to y's and forget the rest

[Bla]

Yes also formulas with x1 v1 a1 t1... then you write a giant formula with lots of stuff and change half the x1's to x2's but forget this one a1 that screws up everything and takes 3*10^8 hours to find

[atomic7732]

i am a goddess

uniformly distributed points on a sphere

[blotz]

dat looks like a circle

[atomic7732]

it's a 2d projection of points on a sphere

[blotz]

oh so it is like see through

[atomic7732]

it don't work

[atomic7732]

ok so there's obviously a problem but i made the attractive force stronger and removed the initial random velocities

and it looks more like it works... i'm going to have to fix whatever problem showed up above (they start to collect around the poles by default?)

[atomic7732]

[00:00] <+kalassak> two particles just decide that
[00:00] <+kalassak> they shouldn't repel directly away from each other
[00:00] <+kalassak> wth
[00:01] <+kalassak> something's wrong with the fundamental math
[00:01] <+kalassak> and i have no idea where to start
[00:10] <+kalassak> i wouldn't be surprised if i just typed sin where it was supposed to be cos or vice versa

[atomic7732]

pole collection has kicked into overdrive

i fixed the math and the particles move in the right direction now (although toward each other in this example, because that's easier to test than repulsion)

i also updated the graphics... green = near hemisphere, purple = far hemisphere

[atomic7732]

and repulsion

[atomic7732]

good news

sometimes two particles on opposite sides of the planet interact with each other, take similar paths, and then shoot off at high speed

i have no idea why


also i have a theory as to why things get stuck at the poles... they basically cross over or near the pole but retain their velocity numerically... so like, they might have a positive y velocity near the north pole, cross it, then still have a positive y velocity... which causes them to cross near the pole again over and over.

not really sure how to fix it, maybe i could try to calculate the final bearing for every particle and if the bearing is southerly/northerly and it wasn't before then the y velocity will be inverted

[blotz]

ｃａｎ　ｕ　ｍａｋｅ　ａ　ｃｉｒｃｌｅ　ｓｏ　ｉ　ｃａｎ　ｃ　ｔｈｅ　ｐｌａｎｅｔ　ｔｈｘ

[vh]

this was a five minute hack i put together.

ever wonder how much time you waste browsing reddit or playing minecraft? too lazy to track your habits? well this is the script for you.

it takes a screenshot of your entire screen (should work for multiple monitors too) with a 1/600 chance every second (so an image every 10 minutes on average), and saves it to a file in the same directory with the unix timestamp as filename.

at the end of the day, you should have 144 screenshots or so which you can look through quickly and get an idea of exactly how much time you wasted.

this works on windows only
requires:
PIL / Image
pywin32

[vh]

random dump of the code i used to compute optimal elytra flight. the first 45 lines are pretty beautiful code, the rest is sloppy

[vh]

simulation of this chaotic system, in which every point has two randomly selected target points that it wants to be equidistant to, and points cannot get too close or too far from each other

https://dl.dropboxusercontent.com/u/42218552/0test.mp4

"so what are the points trying to do?"

they're trying to go to perpendicular bisectors (which are drawn out) of their target points. this obviously makes them equidistant

"but senpai, why are the points so jittery"

well you see, having them actually move toward the bisector requires a good amount of math

"you're good at math ... right?"

i coded this on a friday night, when my brain was mush, so instead of doing the math, i just had each point make 10 random moves, compute how good each move was, and select the best move. which is why it's jittery, because it's searching for local optima and does no planning

[atomic7732]

this was a five minute hack i put together.

ever wonder how much time you waste browsing reddit or playing minecraft? too lazy to track your habits? well this is the script for you.

it takes a screenshot of your entire screen (should work for multiple monitors too) with a 1/600 chance every second (so an image every 10 minutes on average), and saves it to a file in the same directory with the unix timestamp as filename.

at the end of the day, you should have 144 screenshots or so which you can look through quickly and get an idea of exactly how much time you wasted.

this works on windows only
requires:
PIL / Image
pywin32

perfect