H.O.L.: Hi, is there any minimum waiting time between changing leagues? I am above Sebulboss in mad pod racing and there has been multiple timers with message "Those better than the Boss will be promoted to Gold League" but I am still in Silver league (first place).
MrZee: If you beat the boss, there should be a timer at the top saying how long till you get promoted, I think silver to gold takes an hour
H.O.L.: yes and I pass at least 3 timers (2am, 5am and now it is 7:59am - in my time zone). So next will be in 20 minutes, so I will wait but it is strange.
struct: no KalamariKing
struct: someone probably pushed you up
UZIHAMA: Hello world
struct: hi
UZIHAMA: antiwonto is sleeping i guess
Drakon1c: ok
KalamariKing: rip antiwonto
ycsvenom: why lua is very fast in term of "play all testcases"
is it because it is an interpreted language?
Katespizer: probably yeah
Katespizer: but some languages on site are fast even when are compiled
Valdez001: Somebody to do a coop?
Kofi.eo: damn i know nothing about coding apparently
Madara-Uchiha: hi
Madara-Uchiha: :taco: KalamariKing
Madara-Uchiha: yeah anti slept
Madara-Uchiha: it like that almost everyone slept too
Madara-Uchiha: no mod online XD
Uljahn: might be a bug with promotion system, so you either resubmit your code or report on discord's bug-report channel and wait
H.O.L.: ok I will try, thanks for the tip :)
H.O.L.: ok so it helped, I republished the code and now I got notification that I will be promoted to gold league. Thanks for the tip :grinning:
derjack: :tada:
EyeOfTheTiger: hello
tuuuba: hello hocam
AlkhilJohn.: uljahn
AlkhilJohn.: bruh
AlkhilJohn.: u
AlkhilJohn.: How do the mods here not get tired of moderation
AlkhilJohn.: Like do they have a fucking life
5DN1L: welcome back for your first kick
AlkhilJohn.: K
AlkhilJohn.: Hi
Fluffeh: howdy
Drakon1c: ok but unironically every time i glance at this chat i see 5DN1L here
MrZee: They are legion
MisTraleuh: arbre
LYSINES: va travailler Nathan x)
5DN1L: A reminder to newcomers: English only in this channel, and please observe the code of conduct, thanks.
5DN1L: https://www.codingame.com/playgrounds/40701/help-center/code-of-conduct
5DN1L: For French, you may go to #fr
JFB: #ua
JFB: Sorry, wrong window
elderlybeginner: New event (The Hidden Fortress): how to calculate amount of combination for brute force?
Darleanow: Hello guys, for code vs zombies, i'm trying to go to next zombiz x/y while id=min
Darleanow: and when zombie count lowers from 1 change id to the next one
Darleanow: but hwo can i associate zombie id with next zombie x/y
GamingGnawer: most basically the amount of fortress configs should be 2^(n*n). i.e. all cells are either fotress or not
5DN1L: Darleanow, not sure what you mean
Darleanow: i mean that each zombie id is associated to a certain next_y and next_x, this is the way they go and kill human
Darleanow: i'm trying to follow a zombie coordinates depending of it's id
Darleanow: so i can focus the closer ones to humans
5DN1L: do you store all the info in a list or dictionary or something?
Darleanow: no, tbh i don't really know whats the approach of doing this,
Darleanow: i need to count id's ?
Darleanow: maybe should i make a 2D array ?
5DN1L: as a start, go to any nearest human and protect him from there
5DN1L: it's the minimum that can get you 100%
Darleanow: i already did that
Darleanow: by printing human_x and human_y
5DN1L: ah ok
Darleanow: but i want to make it better !:)
5DN1L: have you come up with any strategies?
Hyper_star3301: hey guys can i have some help ;-;
Darleanow: what i know is that zombies focus the closest entity to them, with a priority for humans
Darleanow: i will take aggro when i'm killing them as i'm getting closer
Hyper_star3301: im stuck on second level of A.i :expressionless:
Darleanow: it's the most difficult tbh
Darleanow: just try to do some easy puzzles :)
Darleanow: i started ai like u but it's really hard past silver
Hyper_star3301: i see
Darleanow: i mean u need to understand a few things, so as everyone told me, u should do puzzles !!
Darleanow: you can also do clash of code
5DN1L: Darleanow it depends on whether you want to improve by using just if/then/else conditions, or if you want to start learning some algorithms e.g. genetic algorithm
Darleanow: it can be really fun sometimes
Darleanow: i'd like to dive into algorithm !!
Hyper_star3301: yup i was thinking to do clash of codes and algorithms
Darleanow: start with puzzles Hyper_star3301, when you're confident, you can go clash !! anyways jsut suggesting you can start with clash if you'd like
Hyper_star3301: but A.i looks fun lmfao im using python 3 :joy:
Darleanow: yeah it's cool !!!
Darleanow: i'm using python too
5DN1L: Darleanow, ok. You have to do two things: 1. write a simulation, so you can simulate an entire game from start to end (i.e. how Ash and the zombies move, how many humans are killed). 2. learn genetic algorithm, then implement it in this particular puzzle
Darleanow: maybe you can go to bronze, i'm not really good, and even though i started with this, i managed to get silver ! so you can do it too
Darleanow: wdym by "write a simulation" ??5DN1L
Darleanow: i'll brb in 2 mins
5DN1L: "write a simulation" means: you know the initial positions of Ash, the zombies and the humans. Your code should be able to calculate, if Ash moves to a particular location, what are the next state/positions of all of them
5DN1L: You can do this puzzle as practice first: https://www.codingame.com/training/medium/blunder-episode-1
Darleanow: okay thanks !!
5DN1L: :)
Darleanow: BRO
Darleanow: i wanna hug blunder
Darleanow: hes so depressed :'(
Adam_Sal: maybe
Darleanow: okay so basically, i'm helping a robot to suicide, i feel so guilty
Adam_Sal: That's not very nice of you
Darleanow: :(
Adam_Sal: You monster
Darleanow: :((((
Adam_Sal: You shall suffocate on your guilt
Darleanow: x)
5DN1L: No you misread it
5DN1L: You are intercepting it
5DN1L: not helping it
Darleanow: OH OKAY
Darleanow: nice
Darleanow: it seems to be too hard for me atm
5DN1L: the statement is long, yes, but you can break it down by bits
5DN1L: the test cases introduce new elements one by one
5DN1L: so you can code for test case 1 first, when that succeeds, go on to add more to pass test case 2, and so on
5DN1L: you don't have to code everything all at one go
Darleanow: print("SOUTH")
print("SOUTH")
print("EAST")
print("EAST")
Darleanow: i did that for the first
Darleanow: which is the easiest one
5DN1L: don't hardcode it
5DN1L: you need to do it similar to the Thor puzzle
Darleanow: i need to make a function to locate $
5DN1L: a bunch of if/else
elderlybeginner: how to get [[2, 1], [3, 1]]) from [[1, 0], [1, 1]] working on numpy arrays?
elderlybeginner: ok, got it
Aimee.S: does except Exception:
pass
just carry on with the rest of code if there's no error in try block?
JFB: If it is no error in try block, except: block is just skipped.
JFB: So it is not important what is in this block.
BioSponge_79d8: :flag_sy:
elderlybeginner: numpy: now to convert [True, False] into ['yes', 'no']?
RustyJellyOfPower_d9ee: hello
BioSponge_79d8: hello bitch
5DN1L: mind your language, BioSponge_79d8
5DN1L: or you'll be kicked out
5DN1L: https://www.codingame.com/playgrounds/40701/help-center/code-of-conduct
BioSponge_79d8: sorry
JFB: elderlybeginner - you always can can do something as:
JFB: http://chat.codingame.com/pastebin/0bd74000-ca1d-474a-a138-d2a7f3d2aef4
PerpetualCarnivore_2ff: hi
BioSponge_79d8: hi
RustyJellyOfPower_d9ee: hi
elderlybeginner: JFB it works on 1D arrays only, there must be somthing better with masking
vicop1: selem
vicop1: labess?
PerpetualCarnivore_2ff: koul chi berer
5DN1L: English only please
PerpetualCarnivore_2ff: ok
PerpetualCarnivore_2ff: sorry
5DN1L: https://www.codingame.com/playgrounds/40701/help-center/code-of-conduct
vicop1: sorry bb
vicop1: PerpetualCarnivore_2ff t bg wsh
MusicalBreakfast_4eea: vicop1 shut up please
HeroicSaxophone_6146: bruh
vicop1: oh musical breakfast comment t'as ecris en rouge bg?
5DN1L: No disruption here or get kicked out
vicop: hello pigs
HeroicSaxophone_6146: vasy oses
5DN1L: 2 kicked
vicop1: ok bg
vicop1: [CG]Thibaud le bg
vicop: hello world
vicop: wish games are you coding
vicop: wich
MusicalBreakfast_4eea: the nintendo challenge and you bro
PerpetualCarnivore_2ff: winamax
PerpetualCarnivore_2ff: and u
JFB: elderlybeginner - of course they are better options, but you asked for 1D :-)
JFB: Try this:
JFB: http://chat.codingame.com/pastebin/102faea3-ead5-4f1b-91e8-2188f3f5ae7b
ninjadip: try these Ds
elderlybeginner: JFB, thanks, but... I was faster :wink:, sorry for not pasting, didn't expect anyone would be interested
elderlybeginner: a = np.full((3, 5), 'no')
- wink:
VizGhar: Hey guys... looking into simulated annealing, never implemented it before. How do I pick items from neighborhood If I'm working on multiple parameters?
VizGhar: I'm just trying to generate "Hello World!" using SA on some random text (of same length as expected result)
wlesavo: you just pick some letters and replace them with a random ones, or im not sure what you mean
VizGhar: so i pick let's say 3 letters, replace them with random ones, evaluate them, checking temperature and moving on? I though I have to pick best from 10 random solutions or something
VizGhar: It looks like too random :) I'll see
wlesavo: try starting with greedy algo, ie acepting attempt with stricktly better score, but yeah, your task seems too have way too many freedom
VizGhar: :thumbsup: greedy sounds like hillclimbing for this case
Wontonimo: what is the distance function you are using?
wlesavo: i had somesthing simmilar in BnC2, it worked reasonably well
wlesavo: with scoring like B*10+C
VizGhar: distance function is just simple distance in ascii table (nothing fancy)
VizGhar: sum of distances for each character beween target and actual
Mindarius: :taco: Mindarius
Wontonimo: and when you make a change, is it just totally random, gaussian, or small random ?
VizGhar: total random
VizGhar: I'll make one parameter only, I'll get the idea later on I hope
VizGhar: this one will not converge
Wontonimo: then it isn't Simulated Annealing. For annealing, you need to lower the amount of random over time.
Wontonimo: In the beginning, maybe rand()*26 , then eventually rand()*25 ... 24 ...
VizGhar: aaah that makes sense. I've been using it just for comparison of two solutions :)
VizGhar: thanks. I have to go. I'll try it later
Wontonimo: cool cool bye!
Wontonimo: btw, "annealing" means to lower the temperature gradually. I this case the temperature means the amount of random disturbance.
liuzhifeng123: :grin:
TimberStalker: Why does codingame still use c#8. When do we get c#10.
ninjadip: what an interesting word, annealing, new to me
ninjadip: ty Wontonimo
struct: Languages are not updated often
TimberStalker: Unfortunate
struct: The problem is that some languages updates break some bots
struct: I dont know how good C# backwards compatibility is
TimberStalker: I think microsoft always tries to ensure backwards compatability. I dont remember any features that were removed or changed in such a way.
BadBurger: in kotlin, min() and max() does not work for me for some reason, (using it on list) but sum() average() and count() works. whaaat?
BadBurger: ok, so it has been changed minOrNull()...
eulerscheZahl: c# in general has no issues with backwards compatibility
eulerscheZahl: CG c# however has
eulerscheZahl: System.Drawing.Bitmap no longer exists (would have to include a namespace in compilation)
elderlybeginner: how to bite hidden fortress?
eulerscheZahl: so all my bots that draw debug pictures suddenly started crashing
eulerscheZahl: hm, let me have a look. didn't read the statement yet
struct: 100%
eulerscheZahl: oh, must have been a while ago
eulerscheZahl: but true, i solved it
eulerscheZahl: 5 months ago, no memory left
struct: o.o
eulerscheZahl: python, what was i thinking?
struct: Is that just for puzzles or you cant remember your bots code either?
eulerscheZahl: ah, numpy to solve equation system
eulerscheZahl: just for things that i spend less than 20 minutes on
eulerscheZahl: system of n**2 linear equations. and numpy for the heavy lifting. i vaguely remember now
elderlybeginner: n**2 of sums (row, line) into seprarate 2*n row, lines and then to the end I guess
eulerscheZahl: https://i.imgur.com/HsGJZGQ.png
why does one published solution have a dark and the other one a light theme?
struct: So you can judge the person based on the color of their ide
eulerscheZahl: oh wait, it depends on the tab i'm using to look at it
struct: o.o
eulerscheZahl: one: IDE => back to overview
other: new tab
eulerscheZahl: IDE makes it dark, new tab is white
eulerscheZahl: wanted to compare codes, so i opened the new tab
elderlybeginner: I think the more interesting is what's behind naming function w K, G, B letters :joy:
elderlybeginner: *with
eulerscheZahl: maybe hiding the origin of the code? that user had a similar solution to mine on minesweeper already
eulerscheZahl: i don't get why you would publish prove of how you achieved 100%, meh
struct: who even names their variables with more than 1 letter anyways
struct: :)
NeelD31: no one
NeelD31: software engineers
ninjadip: me...
Mindarius: anyone who wants their code to be legible
ninjadip: yes, even to their one day future self
eulerscheZahl: the teacher who first got me into programming named the variables a,b,c,d,...
struct: well my teacher named them a,z,e,r
eulerscheZahl: at first i didn't even know that the language allows you to be more creative
eulerscheZahl: azerty keyboard, eh?
ninjadip: no teaching of camel/pascal case?
struct: I even use _ on variables
struct: I like to type
struct: http://chat.codingame.com/pastebin/18280fc0-e309-45f2-b71c-b9c1d5b23415
eulerscheZahl: and 1 line of code is enough to tell it's onitama
eulerscheZahl: that's a good thing
eulerscheZahl: ctz
i don't understand this one
struct: __builtin_ctz
eulerscheZahl: ah
Kururugi: anyone know the method to get only second line of ruby with a set of integers separated by spaces?
struct: The other day I found about __builtin_expect
eulerscheZahl: builtin_ctz(x): This function is used to count the trailing zeros of the given integer
struct: yes Kururugi
struct: 1 sec
struct: `tail -1`
struct: p`tail -1`
struct: is what you are looking for I think
struct: or p`dd`[2..]
Kururugi: yeah that looks like it let me check
struct: Im not sure if there is any bash command besides tail -1 that can do this
Kururugi: thanks
struct: was this for temperatures golf?
Kururugi: no this was just something i saw a while back but couldnt remember in recent code clash codegolf
struct: ah ok
struct: Im not sure if this was the command used then
**Mundgus apple
Mundgus: (╯°□°）╯︵ ┻━┻
1457162: eulerscheZahl: - I understand that for elelderlybeginner it was not interesting that names with only one letter - but why these particular letters: K G B. You are probably too young to know this 3 capital letters in exactly this order ...
Mindarius: What about the KGB?
1457162: eulerscheZahl: post code such 3 first variables names: K, G, B
Mindarius: ah
jacek: oh my
corrosive: who is good at coding here?
darkhorse64: nobody, we only chat here
VizGhar: Automaton2000 is...
Automaton2000: that explains why i can't get it to work
VizGhar: How come he is level14? :)
JFB: Automaton2000 is the best of the best
Automaton2000: i think i tried that one yet
JFB: VizGhar - because Automaton2000 is not only the best of the best - but is modest too ...
Automaton2000: its a lot of noise
jacek: do you even :notebook: :soccer:, Automaton2000?
Automaton2000: what league are u in gold?
martinpapa69: is it allowed to post cg forum links here to advertise my stuff ?
KalamariKing: probably not
ninjadip: who is this princess yuki? japanese princess toadstool?
darkhorse64: go ahead, martinpapa69
martinpapa69: https://www.codingame.com/forum/t/alphazero-like-implementation-for-oware-abapa-game/191477
jacek: hm?
jacek: noice
jacek: shall i go back to c4
NewCoder09: :taco: Struct
NewCoder09: is he still off?
Mindarius: tacos? yeah
NewCoder09: No Antiwonto
NewCoder09: thats what i was asking
NewCoder09: hes been off forever
Mindarius: not sure if it's entirely off, the taco functionality is
Mindarius: antiwonto
NewCoder09: he is off
NewCoder09: why Wontonimo
NewCoder09: why is he off
ninjadip: comes back taco tuesday with next version
KalamariKing: antiwonto died :pensive:
Emmus: :sob:
jacek: nyoro~n
Lorenzoisaperson: i do not understand
Ronins: can a begener joine on this clash of code private
Ronins: https://www.codingame.com/clashofcode/clash/2269286b481dc0aeb230e9aa838771199073a58
Ronins: somebody
struct: whats begener?
struct: begginer?
Ronins: yes
Ronins: my is not woking correctly
Ronins: pc
struct: I cant seem to join for some reason
struct: seems broken
Ronins: :thinking:
Ronins: (╯°□°）╯︵ ┻━┻
jacek: youre not beginner?
Ronins: no
Ronins: i am a pro why
Ronins: jakcek you' re not a beginer*
struct: jacek is not a pro
Ronins: okay
Ronins: mister
Ronins: hello
struct: hi
Ronins: I THINK YOU WE'RE 😴
**PatrickMcGinnisII is a PRO :broken_heart: heart breaker :broken_heart:
jacek: :upside_down:
StraumliPerversion: why aren't you talking about hidden fortress?
Eax2078: guys how to play this game?
StraumliPerversion: lol, my hidden fortress approval comment has 4 downvotes
jacek: what fortress?
PatrickMcGinnisII: event started
jacek: not so hidden anymore eh
Eax2078: guys how to play this game?
jacek: what game
jacek: mad pod racing?
StraumliPerversion: where is wonton?
Eax2078: Clash Of Code
Eax2078: what i'm suppose to do/
Eax2078: ?
PatrickMcGinnisII: wonton is playing with his :taco:s
BadBurger: hidden fortress, to calculate total amount of fortresses, should it not be x+y * sum of all counts?
BadBurger: since 1 fort, in a 5x5 grid, would add up to 10 ? and 2 forts would gibe 20? i feel like that would be the case but that does not seem like it, can someone exlpain?
BadBurger: ah nevermind, i feel stupid
PatrickMcGinnisII: i think its sum of all counts/((2*size)-1)
BadBurger: yeah, i left out the -1, realized it as i visually looked at the grid.
ninjadip: there are other ways
elderlybeginner: Hidden Fortres - there's a link to contribution with full solution I guess. Why it's called event then?
StraumliPerversion: only level 29+ can see the solution
StraumliPerversion: is that what you mean?
elderlybeginner: Then I must be 29+. I don't see a point calling in an "evnet" then. It
elderlybeginner: it's just puzzle with open solution
StraumliPerversion: just like any other puzzle...
StraumliPerversion: it is basically potw repackaged
StraumliPerversion: and we are supposed to chat about it until chat is deleted I guess
ikram45: hello
xxd: I think many of the nice features in the Zig programming language would come in handy for writing, say, a MCTS
xxd: i will try that today
struct: why xxd?
Wolf_the_artist: ello
UZUHAMA: Hello world
Coder1005: hello world
HarrisonW: my nam. jef
ethaneCH3CH3: print("Hello world!")
gjin25: Hello the World
xxd: struct it is mostly QOL things like slices, explicit allocations, powerful compile-time execution
xxd: all things that are still possible to code efficiently without
struct: I see, I have never heard about Zig so was wondering
struct: Do you have any bot here that uses mcts?
Yalheim: Is there a difference between clashing 4vs or 8 vs ?
struct: the elo will change Yalheim
struct: Because its based on all players
struct: Im not sure how true skill formula works though
Yalheim: so if i win a 8vs i get more exp?
struct: probably
struct: but its based on the ranks of the other players
struct: if you play vs 4 people that are top 100 you will get more than you would get from winning vs 8 that are > 10000
xxd: struct: I do have two but I am not the best optimizer
xxd: i have a connect4 at 33rd in wood 1 and a tictactoe at around 150th in legend
H.O.L.: Hi, is there any minimum waiting time between changing leagues? I am above Sebulboss in mad pod racing and there has been multiple timers with message "Those better than the Boss will be promoted to Gold League" but I am still in Silver league (first place).
