antiwonto: [auto] ':upside_down:' was defined as ' ɥǝllo '
derjack: :taco: jacek
antiwonto: [auto] Hey derjack, here is a :taco: for loggin in today while it is quiet. You now have 49 tacos
5DN1L: no spamming please
5DN1L: no spamming please https://www.codingame.com/playgrounds/40701/help-center/code-of-conduct
BonCrayon: no spamming please https://www.codingame.com/playgrounds/40701/help-center/code-of-conduct
5DN1L: Shall I ask Thibaud to consider you as a mod, BonCrayon? :innocent:
5DN1L: Oh too bad then
5DN1L: Thought you'd be interested
BonCrayon: Ah Ah
Uljahn: you'll get this awesome mod badge, what a deal! :smile:
5DN1L: English only please
TobiasA: does the ranking in search race get updates or no?
5DN1L: your ranking gets updated every time you submit your code
5DN1L: but cp gets updated only once a day
TobiasA: I submitted my code but it didn't seem to update
5DN1L: has it finished calculating all validators?
TobiasA: and I failed one
TobiasA: I'm not able to view the replay though
5DN1L: your best result is used in the ranking
5DN1L: i see that your best result was 20,272.07 (100% pass)
TobiasA: my best result got yea but my current code completes the course like 3 million times faster
TobiasA: except that one
5DN1L: pass rate counts first
5DN1L: then the time
TobiasA: how can I view the replay so I can try to fix it
5DN1L: so failing one is still worse than 100% pass
5DN1L: check the forum, there's a separate link for that i think
derjack: how much time do you allocate
derjack: most optim puzzles are bugged, and i allocate 30ms most for search race
derjack: and still can rarely timeout
TobiasA: i do 40
derjack: try 20 first
TobiasA: thanks derjack it worked
derjack: 14,500 noice
derjack: Dovee with?
antiwonto: [auto] 'help' was defined as ' https://how-to-properly-ask-a-question.surge.sh '
5DN1L: no spam please
isimkullanmiyorum: hi everyone
struct: Paspartu22 he needs to be in the top1k of your current league
SQUISHYACORN800: great puzzles🙄🙄
struct: you might enjoy multiplayers
eulerscheZahl: struct #de
struct: im late sry
Astrobytes: was gonna report that but it was at 12.57 :P
Astrobytes: struct #World
Astrobytes: guys, if you want a private channel to discuss your classroom stuff go #here
PatrickMcGinnisII: I'm puzzle crazy, 2 more down today
Astrobytes: and it's only earlry
PatrickMcGinnisII: the one i did last night didn't submit apparently, so that was an easy fix
PatrickMcGinnisII: a bunch of new puzzles got dropped in the last couple weeks i never saw b4
PatrickMcGinnisII: eulerscheZahl 's space maze is still haunting me
Astrobytes: yeah there were a few added during the contest iirc
Astrobytes: don't do that
Astrobytes: struct, 5DN1L
Astrobytes: thank you, and good afternoon :)
5DN1L: good afternoon :)
Astrobytes: it's not the content, it's the spamming
antiwonto: [auto] fhefe be respectful and watch your language https://www.codingame.com/playgrounds/40701/help-center/code-of-conduct
Astrobytes: at least he summoned you himself :rofl:
5DN1L: yup, that's good in a certain sense
5DN1L: he asked for it!
Astrobytes: haha, indeed
wlesavo: honorable spamer :smiley:
Wontonimo: racist , so no so honorable
Dihen: please how to to this
antiwonto: [auto] 'help' was defined as ' https://how-to-properly-ask-a-question.surge.sh '
antiwonto: [auto] 'help' was defined as ' https://how-to-properly-ask-a-question.surge.sh '
Wontonimo: ^^ read that
Dihen: help to solve this
Dihen: where should i start
Dihen: everythig is very hard to me
Wontonimo: what language are you focusing on?
Dihen: python 3
Wontonimo: try here instead https://exercism.org/tracks
Wontonimo: if you are just starting
Astrobytes: Persistent spammer kid persistently spams :thinking:
PatrickMcGinnisII: name is somehow familiar
Astrobytes: Not you Dihen, ignore that guy.
Astrobytes: And Dihen: listen to Wontonimo
Wontonimo: :taco: Astrobytes
antiwonto: [auto] sorry Wontonimo but you can only award tacos once per day
Wontonimo: when did I spend tacos today?
Astrobytes: ah lol, wait til after midnight my time :D
Dihen: where should i start?
Wontonimo: fhefe, you've been given a time out. don't spam
Wontonimo: you are welcome to come back if you behave
5DN1L: interesting that even "/kick/k fhefe." worked!
Astrobytes: that's his old nickname
Astrobytes: ah, he added a dot
Dihen: where should i start in python 3
Astrobytes: As with most snakes, the head
Wontonimo: I already sent you a link Dihen https://exercism.org/tracks
Astrobytes: (the basics)
Wontonimo: Dihen, you need to know variables, loops, and functions really well before coding here
Dihen: ok and thank you so much
Dihen: guess first learn python
Wontonimo: that was your NN wasn't it ;)
Dihen: what is nn?
Wontonimo: Neural Network
Wontonimo: it's not like we know what the shape, inputs, or outputs are derjack, so it's useless to anyone other than you
derjack: will i get score less than 11k in search race this way :thinking:
struct: where is your backgammon NN?
Wontonimo: who is TopMaster ?
Dihen: artificial intelegence, machine learning, neural network, deep learning right?
derjack: where is backgammon referee
struct: hidden because its awfull
Dihen: what is the best coding langhage in here
struct: depends on what you want to do
Dihen: makes sence
struct: I like c++
bingler: python and ruby are king for the multiplayer clashes
Ayza: gotta disagree with that
Ayza: fastest and shortest, probably not
doogyman: what then
struct: Scarfield plays backgammon right?
struct: c++ is far from the best to play clash
jacek: oh another multiplayer game pending approval
struct: which one?
struct: to write the statement or to try this game
5DN1L: No, there isn't a way
jacek: generally you shouldnt see te validator
jacek: but last test cases passes?
Joleaf: Is there an admin who can ban a spammer in the DE chat? :)
antiwonto: [auto] Hey Joleaf, here is a :taco: for loggin in today while it is quiet. You now have 2 tacos
5DN1L: it's too late now
5DN1L: that message was hours ago
5DN1L: Thanks anyway
Scarfield: still here struct?
Scarfield: the backgammon coach said that he does not think it should be possible to postpone a backgammon game, and win by pip score. Also that is rare that a game last more than 100 turns per player
struct: So I dont need to implement it :p
Scarfield: you can postpone the game, but its just not a winning strategy
jacek: postpony games eh
jacek: still, if youre losing, can you postpone enough to draw?
Scarfield: maybe, without pip count, but going afk now though
struct: I think its unlikely
struct: you can only stall for so long
jacek: why am i thinking about inputs to the NN instead of making sim first ~
Wontonimo: because you love NN more than sim
Darleanow: Hello guys
Darleanow: Wonto its been a while :o
Wontonimo: yeah, i've been here but in the background
Wontonimo: what kind of practice have you been doing lately?
Darleanow: OOP eheh
Darleanow: i've coded some cool things
Darleanow: which are on my git :)
Darleanow: and now, i'm developping a text rpg game
Darleanow: Hello jacek :)
Wontonimo: nice, that's fun. what lang?
Darleanow: Only py :p
Wontonimo: did I ever share this demo text rpg with you https://tech.io/snippet/wLSSnKR
Wontonimo: you may have to run it locally
Darleanow: not like a rogue, i mean i'm not sure
Wontonimo: py is a good lang. don't say "only py"
Darleanow: but there is some progress, like monsters become stronger, and u can get equipement
Darleanow: Yes u did, this is why i thought i'd know enough to do it !!
Darleanow: The idea is inspired by u wonto )
Wontonimo: oh cool! thanks
Darleanow: Do u have a favourite class or monster type that i could add ?
Darleanow: I'll send u the source code, which will be on my git if u wanna give it a look
Darleanow: Aight !!
Darleanow: this isnt a very scary monster
Wontonimo: yeah, DM me the link
Wontonimo: how big of a slug are you thinking? It can be pretty scary
Darleanow: Aight, will do whenever it's finished !
Darleanow: I mean u can be a giant
Darleanow: even a 2 m wide slug wouldn't be that terrifying
Wontonimo: and what if it is poisonous ?
Darleanow: Oh you're adding too much details ahahhaha
Darleanow: I only have HP DEF and ATK
Darleanow: will maybe update it with some more features once it's done :)
jacek: add poisonous frogs
jacek: or toads
Wontonimo: have you ever tried to squish a slug. They are tough. Imagine a 800 kg slug and how invincible it would be
Darleanow: jacek i'll do it :)
Wontonimo: anyway, I'm obviously a fan of humour monsters
Darleanow: But i don't wanna add too many complex ideas, like poisonning and crit e.g.
Wontonimo: good idea
Darleanow: I like this kind of humour !
struct: If add sprites for dices do I need to add the license?
struct: how does it work?
Westicles: get scarfield's gf to draw them?
struct: I think this is a reference to euler dice duel and Zarthax
Westicles: oh, yeah it was zarthaxx's girlfriend
struct: zarthax girlfriend was gonna create the dices for dice duel
jacek: thats what she said?
Darleanow: YOUHOU GUYS
Darleanow: EVAL IS SOOOOOOO COOL
Darleanow: the function in python
Darleanow: LOVE IT
Darleanow: (some ppl told me it was a BAAAD idea)
Astrobytes: that's the spirit :D
Astrobytes: Yeah, you can do clashes in between puzzles ;)
Astrobytes: or the other way around ofc
Astrobytes: lol, all good
Astrobytes: Personally speaking, yeah
Astrobytes: that's a good push to learn something new right there. Try to do work through it on paper/whiteboard. If it's an unfamiliar topic, do some research
Astrobytes: hey MSmits
MSmits: I figured out a way to do 37 and 38 seed oware DB :P
Astrobytes: how so?
MSmits: I was caching some intermediate result but I realized I can read this from HD in chunks and losing barely any speed. This gives me 10-15 GB extra RAM to work with
waterproofsodium: thanks for the advice. I am wonder if I should prioritize learning tho. since I cannot learn everything there is. And researching for a difficult puzzle could take in average many hours
Astrobytes: MSmits: oh nice! That should help indeed. Are you running it now?
MSmits: it's still a lot of calculation though. I estimate 7-8 days for 37 and 11-12 days for 38
MSmits: also I improved my meta mcts. Believe it or not, it seems better to just run a normal mcts when your DB is that big
Astrobytes: waterproofsodium: of course don't try to learn everything, pick a topic, say graph theory or something
Astrobytes: Meta MCTS is overkill?
MSmits: i solve faster with a normal mcts in C# that just looks up at 36 seed, than running 10 c++ bots playing games and backpropagating
Astrobytes: makes sense
MSmits: the games just take a lot of calc time
MSmits: just a single rollout in C# works too
MSmits: so that makes it run 1000 rollouts/s or so
MSmits: and was 100 before, with 10 c++ games run in parallel
Astrobytes: Nice. More convenient being in C# too.
MSmits: yeah, i dont think c++ would be that much better at this point. All nodes are looked up from a persistent dictionary (so SSD)
jacek: will there be a rematch?
MSmits: maybe at some point if he's still doing it. I can probabyl arrange it
Astrobytes: I am sensing that on the horizon jacek
MSmits: i am just hoping i did not make a bug in redoing my DB program for 37 and 38, i am verifying 37 when it is done.
Astrobytes: Yeah, don't rush it
MSmits: kinda sucks when it has to run this long
MSmits: and then you find a bug
MSmits: pretty sure universities have this happen to them a lot in the computer science faculties
MSmits: wasting time
Astrobytes: Yeah, plus deadlines
Astrobytes: bad combo
MSmits: btw i did that entry code puzzle, but I feel I cheated :P
MSmits: i used wikipedia, like one my of students trying to cheat an assignment
Astrobytes: waterproofsodium: if you are stuck and you know what you're asking hints about then sure. Also each puzzle has a forum thread with advice etc
MSmits: I won't say where the solution is, but it is on wiki
MSmits: just adapted it a tiny bit
Astrobytes: lol, hey it worked right :D
MSmits: i found nothing on the forum either
Astrobytes: it's a new puzzle that one right MSmits?
MSmits: well, new to me anyways
MSmits: waterproofsodium it's ok to ask for hints
jacek: it is? oO
Astrobytes: Back in yer box jacek :P
MSmits: well it's not ok to expect an answer
MSmits: but to ask is ok
Astrobytes: As long as you can prove you've tried at least a few things, people are usually willing to help or point you in the right direction
MSmits: it's just that a lot of times noone is on that knows the solution to your specific problem unless it is currently a *hot* topic
MSmits: you have to know the solution to give a hint
Astrobytes: Or at least be familiar with the problem
MSmits: I am working on platinum rift 2 btw
Astrobytes: ah nice, fun game
MSmits: just trying to get something working. I never made a real multi agent bot unless you're counting those smitsimax solutions that are highly specific to some games
MSmits: waterproofsodium there are hundreds of things to ignore on this site, just do what seems fun/interesting
Astrobytes: that's probably wise, I mean you wouldn't attempt a number theory puzzle with zero number theory knowledge :)
MSmits: a lot of times i taught myself somethign to solve a problem
MSmits: like learning dancing links for that number shfiting puzzle
Astrobytes: ^ this is what I've been saying MSmits
MSmits: never heard of it before
MSmits: ahh ok
Astrobytes: gaining knowledge through doing puzzles or multis/whatever
Astrobytes: versus clashes
MSmits: sometimes you can figure out a solution and later learn it is some official algorithm that has a name, that you reinvented yourself
MSmits: this is how i reinvented binary search for batman :P
jacek: or most graph traversal things
MSmits: yeah graph stuff
MSmits: personally, I feel you should be able to say you invented something if someone invented it before you and you didn't know about it
MSmits: it's just an ordering issue of two independent events
Astrobytes: Smits-First Search
Astrobytes: well many discoveries in the past have been discovered around the same time by different people, in different locations
MSmits: like calculus
Astrobytes: And problems solved etc
MSmits: or was it linear algebra?
MSmits: Newton and Leibniz
MSmits: could be yeah
Astrobytes: Something calculus-related
MSmits: I heard it 10 yrs ago
j4at: I invented antiderivative
j4at: they should add my name to the text books
MSmits: that's like a medicine you take when you are forced to do derivatives?
jacek: im indifferent to calculus
Astrobytes: the indefinite integral
j4at: I tried to calculate pi and found out how to do antiderivative like 7 years ago
Westicles: I'd like to make an exact cover puzzle where DLX is the only option to solve, but I think the input size on CG is too small to keep people from brute forcing instead
j4at: before studying it
Roulio__: ruby is so powerfulk
MSmits: well noone actually calculated pi
j4at: i mean estimation ...
MSmits: yes, i meant you were exact in your statement
MSmits: you tried :0
MSmits: anyone ever try netlogo?
MSmits: I learned it yesterday and it's the simplest language ever
MSmits: more Englishy than python even
Astrobytes: never tried it, heard of it, but no experience
MSmits: not sure if it is a real programming language but you use it to write multi agent models
MSmits: I thought it would be a lot of work to learn, but i prepared a 2 hr class in 30 mins without even knowing the program
Astrobytes: yeah I came across it via something biology-related iirc
MSmits: I did a rock paper scissors model with wolves eating sheep, eating butterflies eating wolves. Took 5 mins
jacek: is this like logo and turtle
MSmits: waterproofsodium another yes from me
MSmits: yeah jacek
Astrobytes: waterproofsodium :D
Astrobytes: butterflies eating wolves? :o
MSmits: well they were standard available shapes
MSmits: it did not have rocks and scissors
MSmits: so i went with that :P
Westicles: cue the schmetterling meme
MSmits: only Germans would call something cute a name like that :P
MSmits: what do they call a ladybug i wonder
MSmits: there's nothing wrong with it, but to me it sounds like you're saying something dirty
MSmits: hehe ok
MSmits: ohh thats it
Astrobytes: Took a while Westicles but there it is
jacek: lul, isnt it
MSmits: I can read German a little bit, but I can't speak it
MSmits: we learn it in school, mandatory
MSmits: but... 26 yrs ago
MSmits: yeah, it's not fair, you guys don't learn Dutch
Astrobytes: French or German was mandatory here. Took German, ended up learning more French than German in later life :D
MSmits: well... French is mandatory as well here
MSmits: You do German and French for 3 yrs and then you drop 1
MSmits: English is mandatory till the end, no choice there
Astrobytes: we get one language and that's it. My uncle had the option of (amongst other things) Ancient Greek - same school, many years prior
MSmits: oh yeah we also have ancient greek and latin as an option
j4at: we learn German in school too and it was mandatory.. And I got 10% in Final exam because didn't study German at all
MSmits: and in my school specifically, also Chinse
j4at: I didn't even come to class :3
MSmits: dutch is apparently a harder language to learn. I can't tell because I am a native
j4at: I'd rather learn assembly
Westicles: I think in the US high school they purposefully teach us to mispronounce french so we'll fly over and piss them off later in life
MSmits: they did some tests where they measure the age at which children become fluent in a language and with Dutch this happens later than any other European language
Astrobytes: You mean you don't just learn other dialects of American English in the US? :D
jacek: that means dutch children are delayed?
MSmits: in their own language, somewhat yeah
Astrobytes: It's all the cannabis
MSmits: so when you do a course in Arabic
MSmits: you shall not pass ?
Razovsky: i am not
Razovsky: a cat person
Razovsky: i see you
MSmits: i see your profile pics
Razovsky: i don't know what you mean by that
Razovsky: how are you MSmits, have'nt seen you in a while
MSmits: yeah i've been on a bit of a CG break, partially caused by work
MSmits: filled in for a colleague that was on paternal leave
Razovsky: actually, same
Razovsky: cool from you
MSmits: well i do get paid for this, but i normally don't work that much
struct: There are opening books for backgammon o.o
MSmits: glad it is done
MSmits: for a game with random !?
jacek: there is particular opening discovered by td-gammon that humans thought it was bad but it was good
Astrobytes: Presumably it's priority based moves by whatever values are rolled
Scarfield: sure, good moves for different dice. 1-3, and 1-6 are considered the best starting dice.
MSmits: ahh ok
Murat_Eroglu: 5-6 is also good imo
MSmits: sounds more like a strategy thing
Murat_Eroglu: or 6-6 if you start first
j4at: backgammon is a solved games
Razovsky: never played it
Razovsky: am not brave enough
MSmits: never thought about solving a game with random elements
MSmits: seems difficult
struct: I have no idea how to make an ai for this
struct: besides ept(0)
j4at: There is 32m possible positions so If you are planning add it to bot programming. Probably everyone will be able to perfectly solve it
j4at: Write lookup table :"D
struct: 32 seems low
Scarfield: 32 is low yea :)
MSmits: 32 million is really hard to fit in codesize
Razovsky: i missed those discussions not gonna lie
MSmits: impossible even without some compression
MSmits: (and that's assuming 1 bit per result, maybe you'll need more)
Wontonimo: compress it lol
j4at: Well a lot of those positions will never be visited because they are bad
jacek: 32m? wtf where did you get that number
MSmits: says 10**20 here: https://en.wikipedia.org/wiki/Game_complexity
jacek: "Hypergammon is a game in which players have only three counters on the board"
Astrobytes: Hypergammon is a ga
Astrobytes: beaten again :(
j4at: ops stupid google
Westicles: how does blaise get an alert every time people change names?
MSmits: backgammon is similar to checkers in statespace complexity
j4at: my bad :(
MSmits: but it may be far harder to solve
struct: just hack random
struct: problem solved
Westicles: he notices when I change name for taco shenanigans or if thib impersonates someone
MSmits: i have a question about platinum rift 2
MSmits: if you own a zone, but you don't have vision from a pod, do you know you own it?
MSmits: apparently you cant tell the difference between neutral and opponent zones if you dont have vision
waterproofsodium: does someone know whether https://www.codingame.com/ide/puzzle/stock-exchange-losses can be solved in O(n)?
MSmits: i solved it, let me check
MSmits: yeah seems I(n)
MSmits: just 1 loop and some ifs
MSmits: loop from 0 to n... so that seems like O(n)
MSmits: it's remarkably short too. I solved this in C# and i usually end up with 100-200 lines even for easy puzzles, but this one is 34 lines everything included
MSmits: well once you realize how to do it, it's really simple
MSmits: just remember, if the price goes up, then either the worst possible sell-moment was just before that, or the greatest loss is somewhere else
MSmits: so you reset the difference every time the price goes up
struct: tbf this is a physics problem
MSmits: not sure it would detect 10 -> 2 -> 9 -> 0
MSmits: because the greatest loss is 10 there
MSmits: but it may think it's 9
j4at: solved in python using 1 loop and 1 min and 1 max function calls
MSmits: yeah i am trying to understand if mine does this correctly
MSmits: ohh right, i understand it now
MSmits: it should take care of all cases
MSmits: basically you have a start price and an end price.
MSmits: which gives the biggest loss
MSmits: you first price is the first start price, then you keep going to try to find a lower and lower end price
MSmits: and you record the largest difference. if you find a higher price than the start price, then that is the new start price
MSmits: you can go though it linearly
MSmits: normally I don't understand my 2 yr old code. This one is a nice solution :)
MSmits: oh sorry if that spoiled it, I figured it was more about the coding
MSmits: will be more careful about this in the future
MSmits: I think I have gotten dumber in the last 2 yrs. Not sure if i would have figured it out if i saw this puzzle for the 1st time now :P
MSmits: yeah i think so
MSmits: that could be the same thing yeah, but it's all in the details
MSmits: language is less precise than code
MSmits: the latest max is just the max that you have found so far, going through the loop
struct: I think I solved that problem on paper first
struct: I think I did it like 4 years ago
MSmits: i may have also, that's why it seems hard to me now, just looking at it and trying to figure it out without writing stuff down is hard
MSmits: paper is so useful
MSmits: nice one :)
jacek: you waste so much paper eh
MSmits: yeah, i waste a lot of paper writing down symmetry transformations of board games :0
MSmits: nine mens morris is the worst of these
MSmits: you cant write a simple function to transform them, or at least that seems hard. So I mapped all possibilities with arrays
struct: ok I decided to make the dices myself
jacek: you still have solved 9mm?
MSmits: i did not finish solving the opening stage, but i solved the endgame completely (even 9x9)
MSmits: i have the code for the openign game though
MSmits: just got distracted
MSmits: including the opening game, i'd need 40 GB to store it all. I'll do oware first
MSmits: there's a free DB available written in c++ with hungarian comments if i remember correctly. I could not understand the code and their DB is bigger than it has to be.
MSmits: (70+ GB)
struct: Make sure to comment it in dutch
MSmits: Yes, my revenge
struct: Where is trictrac, he must play backgammon
MSmits: is he still active?
MSmits: or did CG run out of content for him?
struct: He was last constest
MSmits: ahh ok
MSmits: he consumes arena's faster than they appear
struct: Maybe he already has a bot for every popular board game
struct: just in case
MSmits: yeah i think so
MSmits: ask him how his Janggi bot is next time you see him
MSmits: this makes a lot of sense jacek
MSmits: only a boardgame understands a boardgame
struct: I should have ported a french game for free upvotes
MSmits: gonna get some sleep. I hope to have some time to get a working pr2 bot tomorrow. Not going for top 10, just want a somewhat capable bot
MSmits: as a learning exercise
blop200: just had a dsa exam today
blop200: this website helped a lot
blop200: I would advise learning basics first
j4at: Learning a language a is boring, atleast for me. I prefer learning from practicing. You can use CodinGame to find your knowledge gap and to stimulate yourself to learn. But there is things that you can't learn here. So I will suggest doing it parallel play CodinGame and learn from other sources. But you should probably learn the basics first.
j4at: this might help. https://www.codingame.com/learn
Darleanow: BotCharles, u have a lot f
Darleanow: of options, i've spammed clash of codes, while googling, it helped a lot to understand even some of the basics, (I've started from scratch too)
Darleanow: U should do also projects
Darleanow: for exmaple
Darleanow: you can try to understand how strings, lists, numbers works
Darleanow: try to print a few things
Darleanow: then you can move on to some basic maths
Darleanow: Where you will learn the most, will be the projects you do
Darleanow: Get an idea, and then try to do it, using google as much as you want etc...
Darleanow: But CG isnt the best platform to learn imma assume, it's more focused on training, and becoming better with knowledge you already have, programmiz is a simple website, that will allow you to learn C and Python
Darleanow: The key is practice practice practice
Darleanow: But don't forget theory :)
antiwonto: [auto] Hey waterproofsodium, here is a :taco: for loggin in today while it is quiet. You now have 18 tacos
struct: you can get 3 points in a few minutes
struct: just choose any multi
struct: I would say coding points
struct: mean max might be one of the hardest multis keseng
struct: it should be given in the for loop
struct: check unitType I guess
struct: its not easy waterproofsodium
struct: you might need to reach high rank in some multiplayers
struct: ah top 500 in clash
struct: I dont know
struct: Long time since I played clash
Astrobytes: you have to play constantly to maintain that position
Astrobytes: because of the short decay time on the clash CP
Astrobytes: lots of people just clash to maintain their rank, some do other things alongside but whatever floats your boat is best :)
j4at: For shortest code learn python. I think that Python and C# are not that much different
j4at: and you need only to learn the tricks
j4at: no need to learn advanced concepts
Waffle3z: haven't submitted anything new to "spider attack" and I'm 55 places higher than when the contest ended