Members in Shoutbox
None.
Shoutbox Search
Shoutbox Commands
/w [name] > Whisper
/r > Reply to last whisper /me > Marks as action Shoutbox Information
Moderators may delete any and all shouts at will.
|
Global Shoutbox
Please log in to shout.
[2014-12-15. : 7:29 am] Sacrieur -- there's an article for that too http://www.staredit.net/starcraft/Kills_to_cash[2014-12-15. : 7:28 am] O)FaRTy1billion[MM] -- like unless you have specific and binary gamestates or something, switches aren't all that useful[2014-12-15. : 7:28 am] zsnakezz -- i just want to make a system, that can give me money every time i kill a unit[2014-12-15. : 7:27 am] O)FaRTy1billion[MM] -- Other than for randomization, but a lot of times that can go hand-in-hand with DCs[2014-12-15. : 7:27 am] O)FaRTy1billion[MM] -- switches aren't really useful anymore, their use has been replaced by DCs xD[2014-12-15. : 7:26 am] Sacrieur -- And "If Current Player's killscore is at least 1, then set switch 1."[2014-12-15. : 7:26 am] zsnakezz -- or i could say, wait 200 milla seconds, and set death counter to 0[2014-12-15. : 7:25 am] Sacrieur -- In the condition of the whole system, you may add a requirement, "Switch 1 is set."[2014-12-15. : 7:25 am] O)FaRTy1billion[MM] -- switches are basically global (in that a switch set for one player will be set for any other player) deathcounters that can only be 0 or 1.[2014-12-15. : 7:25 am] Sacrieur -- Right so say for efficiency reasons your kills to cash system slowed down the game if it ran all the time.[2014-12-15. : 7:24 am] O)FaRTy1billion[MM] -- Well, most people use deathcounters as a sort of variable to track gamestate, level, XP, etc. ... Switches really are only used for randomization.[2014-12-15. : 7:23 am] O)FaRTy1billion[MM] -- You set a switch, and then it is enabled. You clear a switch, and it is disabled. They are global, and their states remain constant across all players.[2014-12-15. : 7:21 am] O)FaRTy1billion[MM] -- On a more serious subject, should I eat chili, mac and cheese, or chili mac and cheese?[2014-12-15. : 6:36 am] Zycorax -- S if you're using British English, Z if you're using American English[2014-12-15. : 6:19 am] Jack -- Humm, another optimisation would be to calculate a table of each d(n) as you go, making each loop progressively quicker[2014-12-15. : 6:06 am] Jack -- An optimization would be to precalculate all primes, add one per prime number under 10000 to the sum total, and then never check those primes for amicableness again.[2014-12-15. : 6:05 am] Jack -- https://projecteuler.net/problem=21 that means every prime is amicable to every other prime[2014-12-15. : 6:04 am] Jack -- Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). |