AryanTripathi: wdym Westicles?
Westicles: there is a rule about clashes with only two outputs, like true/false
Husoski: "Binary outputs" refers to a problem which only has two possible results, like 0/1, True/False, Yes/No, etc. It's too easy to guess to get a 50% score
AryanTripathi: hmm
AryanTripathi: i've an idea
AryanTripathi: maybe I should ask them to print the health of the grasshopper?
AryanTripathi: If it is below 0 or equal to 0, you've to print "Dead"
AryanTripathi: *dead* lmao
5DN1L: yeah, some more fitting description is always better than a generic word "false"
AryanTripathi: yep
AryanTripathi: done :thumbsup:
5DN1L: Guess I'll have to wait for CG to fully upload your changes first
AryanTripathi: it's updated now
AryanTripathi: feel free to tell me if there's any type of mistake
5DN1L: :ok_hand_tone1:
Tien118: hi
AryanTripathi: @5DN1L, I made the changes
5DN1L: cool
DraH: taco
antiwonto: [auto] Hey DraH, here is a :taco: for loggin in today while it is quiet. You now have 1 tacos
5DN1L: How are you today, Automaton2000?
Automaton2000: this is not a problem
**PatrickMcGinnisII burps
5DN1L: Why here :expressionless:
PatrickMcGinnisII: https://www.codingame.com/ide/puzzle/clash-of-bots
TuiTeeraphat: hi
TuiTeeraphat: :grimacing:
DraH: :taco:
antiwonto: [auto] ':taco:' was defined as ' A currency to some, sustenance for others '
tentoes: taco
OpenTools: lol
derjack: ohai
antiwonto: [auto] Hey derjack, here is a :taco: for loggin in today while it is quiet. You now have 56 tacos
derjack: :taco: jacek
antiwonto: [auto] derjack has awarded jacek 6 tacos. jacek now has 11 taco. derjack now has 27 taco
derjack: :tada:
AnciukastheChip: :kiss:
MrDebugger: taco
Razovsky: 56 tacos - 6 tacos = 27 tacos ?
Razovsky: antiwonto practice your maths mate
5DN1L: derjack ate some
Sephirious: What I dont get is, at the Clash for shortest code; of course people who write it with python are gonna get shorter character than C++
Sephirious: Why is it like that ?
AryanTripathi: bruh
AryanTripathi: cuz python is easier
AryanTripathi: and c++ is a bit harder
5DN1L: that doesn't explain shorter/longer code
AryanTripathi: lol
AryanTripathi: in c++ you need to import modules and other things that makes your code long, that's why you will see less people coding in cc++
AryanTripathi: *c++
Zexion: You're competing against other people, there are languages better for golfing. It is on your side to choose the best language that suits your goal
AryanTripathi: in c++ it is important to import modules, but in python modules are imported when needed
5DN1L: yes, AryanTripathi, and all the main, all the brackets, all the semicolons
5DN1L: for python, indentation
AryanTripathi: yep true true
wansui: you
wansui: 大佬们帮我调试下
5DN1L: This channel is English only
5DN1L: for Chinese please go to #cn channel
hinds44: in wood league 1 C#, all the samples' Costs are -1
does anyone have any idea on what is going on?
Grantas_on_30fps: 78
5DN1L: hinds44 I'm assuming you're asking about Code4Life since you didn't mention it in your question...
5DN1L: If I remember correctly you have to diagnose the sample first before you get to see the costs
hinds44: thanks 5DN1L, I realised that I was adding samples to a list, but not clearing the list with each turn
5DN1L: oh ok
hinds44: always user error :joy:
5DN1L: :)
emilyyyyyyyyyyyyy: HI
argumanevi: hi :)
Marktrouble: join in clashofcode
Marktrouble: https://www.codingame.com/clashofcode/clash/24476682bf7cc9fda603da007480a4128072d23
antiwonto: [auto] hey Marktrouble dont paste those links here. Use the channel #clash
emilyyyyyyyyyyyyy: do you guys wanna be friends
jasmineeeeeeeeeeeeeeeeeeeeeeeeee: YES
Charlotteeeeeeeeeeeeeeeeeeeeeee: yas
5DN1L: Just in case: https://www.codingame.com/playgrounds/40701/help-center/code-of-conduct
5DN1L: Reminder
emilyyyyyyyyyyyyy: YAY
Uljahn: do you guys wanna practise coding? :smirk:
helloimbored: no nonce
Manishgru: v
Tien118: hi
nickolewo: 0.0
TimothyAlexisVass: :taco:nickolewo
antiwonto: [auto] Hey TimothyAlexisVass, here is a :taco: for loggin in today while it is quiet. You now have 1 tacos
TimothyAlexisVass: :taco:nickolweo
TimothyAlexisVass: :taco:nickolweo
TimothyAlexisVass: .....
TimothyAlexisVass: :taco:nickolewo
TimothyAlexisVass: :(
Comrade_Elmo: :)
AryanTripathi: taco
AryanTripathi: take taco
antiwonto: [auto] That taco command has moved to the #taco channel
zakacat: Give :taco: TimothyAlexisVass
antiwonto: [auto] zakacat has awarded TimothyAlexisVass 2 tacos. TimothyAlexisVass now has 3 taco. zakacat now has 32 taco
5DN1L: :taco: zakacat
antiwonto: [auto] 5DN1L has awarded zakacat 5 tacos. zakacat now has 37 taco. 5DN1L now has 6 taco
zakacat: whoop whoop
Razovsky: are tiananmen square jokes allowed on #cn channel ?
5DN1L: oh dear
Razovsky: i wonder what happens if i go there
Razovsky: are their account suspended or what, will i be banned from there, or whatever ?
5DN1L: well
5DN1L: 1. CG says: don't bring politics to this chat
b0ot: The Gerrymandering problem seems to be harder than I expected at first look
Razovsky: it is history
5DN1L: 2. I don't know other mods, but I don't really watch there much
Razovsky: okay
5DN1L: 3. That chat is not very active anyway
Razovsky: yeah
b0ot: I am struggling to see how to make it recurssive
b0ot: I can generate all of the potential slices
Razovsky: cool
Razovsky: now evaluate the best score with each combination
liuxiao99: 我感觉在学校学的还没这里学的好
5DN1L: Good to know, but this channel is English only
5DN1L: Please go to #cn channel for Chinese
Husoski: b0ot One thing to do when "thinking recursively" is to assume that you have all smaller cases solved. It's a lot like mathematical induction.
Niminos: the logic of my first program is better than most of yours :)
Niminos: i cannot understand how to know which project to choose
Niminos: because you cannot know the expertiseGain before studying it
5DN1L: Code4Life?
Niminos: y
eulerscheZahl: ignore project until gold or even legend
eulerscheZahl: just complete your samples
eulerscheZahl: also the experience gain for each sample is given as input after you diagnose it
Niminos: wow that's rude :p
Niminos: but okok
struct: jacek on search race do you use more than 3 angles?
jacek: what do you mean 3 angles?
DomiKo: -18, 0, 18
jacek: i use [-18;18], all ints
Wontonimo: i use all ints
waterproofsodium: gm gm
Wontonimo: actually i do -25 to 25 then truncate to -18 to 18. you may think that is crazy, but it worked better for my GA
struct: I tried adding a bit more angles but my bot refuses to use them
waterproofsodium: struct I just solved your clash
eulerscheZahl: jacek even uses all speeds in [0,200]
waterproofsodium: the multiply and sum
eulerscheZahl: n*n*(n+1)/2
Wontonimo: the volume of a wedge?
Wontonimo: with a square base
eulerscheZahl: no story behind
Wontonimo: what algo are you using for search race struct ?
struct: I copied my beam search from spring challenge 2021
Wontonimo: from Totoro ?
ycsvenom: V=(bh/6)(2a+c)
Wontonimo
struct: yes
ycsvenom: this should be it
Wontonimo: reusing totoro code for search race :thinking: very interesting
struct: wontonimo the clash is basicly I give N and they need to do n * n + n - 1 * n + n - 2 * n
struct: until n - x meets 0
struct: I forgot parenthesis
struct: I had MC before but just copy pasting was like 600 points difference
Wontonimo: for the beam, what's the criteria you use for pruning the beam?
eulerscheZahl: https://www.codingame.com/contribute/view/476003c4859dea368c1587acc951182556c
Wontonimo: in search race
eulerscheZahl: there is no x
struct: The evaluation of the state
struct: number of checkpoints crossed and distance to next
struct: basically its magu s eval from csb tutorial I guess
waterproofsodium: oh eulerscheZahl that formula was for me?
waterproofsodium: nice
struct: yes waterproofsodium
waterproofsodium: struct no timeout for using a loop? :D
jacek: i use distance to (next checkpoint - 1 * vel)
waterproofsodium: maybe you intended cause I had to use long
struct: nah
Wontonimo: hmm, struct your beam destroys my GA in search race
struct: it did way better than my MC
struct: and its using 0ms
struct: 2*ms
struct: I would have copied chokudai but the beam that I used with it is slightly different
struct: wont work here
struct: holy
Wontonimo: moly ?
eulerscheZahl: moly?
eulerscheZahl: damn
DomiKo: damnnn
struct: this submit was good
struct: lol
DomiKo: what happend?
struct: I wont from 12.7k to 11.1k
struct: went*
DomiKo: damnnn
jacek: RNG?
struct: no
struct: it still uses depth 10
struct: I just did - vel
struct: like you said
eulerscheZahl: you just bypassed me :(
DomiKo: yeah it's a magic trick
Wontonimo: it's as if taking into account velocity is useful
Wontonimo: in a physics based challenge
eulerscheZahl: -v in what way?
struct: in eval
struct: - dist(nextCheckpoint.pos - pod.vel)
DomiKo: now try - 3 * v
struct: something like that
Wontonimo: or run a search over N for -N*v
jacek: do meta GA
struct: maybe ill play with beam a bit more
jacek: does it still use only 3 angles?
struct: yes
struct: and only depth 10
struct: with 1800 width
Wontonimo: _someone_ used to call GA "garbage algorithm" , and seeing as BEAM just destroys it then I'd say that description is kinda appropriate here :O
eulerscheZahl: doesn't work https://www.codingame.com/replay/639889981
struct: do you take into account number of crossed checkpoints?
LandinW: oh yeah baby just won a small coding clash with cpp
jacek: code golf?
Wontonimo: congrats
eulerscheZahl: must be something with that
LandinW: nvm somone just came in with 1/5 size program 4mins later
struct: i do check * 50'000 - what I said
LandinW: :(
struct: check = crossed
eulerscheZahl: doesn't do the trick for me. meh, i don't feel like trying
eulerscheZahl: oh wait, you wrote
- dist(nextCheckpoint.pos - pod.vel)
Wontonimo: i do checked*10'000 - distance to next checkpoint - 3v
eulerscheZahl: i did:
- dist(nextCheckpoint.pos, pod.vel)
eulerscheZahl: dist to what even? the current car pos?
struct: yes
struct: pod.pos.distance(nextcheckpoint.pos - pod.vel)
j4at: Yeah GA is really not that good. Evolution strategies is a better alternative atleast in my experience.
Wontonimo: and 15 move lookahead
SalvG: ehi guys, does anyone know what is the input of "Everything" test case in "Moves in maze"?
SalvG: i get an error, but the output is correct
jacek: what error
jacek: do you have additional space or newline
SalvG: http://chat.codingame.com/pastebin/8232ba76-219b-448d-a3c1-402c8d73e458
SalvG: no
jacek: w00t
SalvG: it says that validators give me an incorrect answer to "prevent hard coded solutions". weird, think I ve used bfs right
5DN1L: It just means the validators are different from the test cases, and your code can fail if it can't pass the validators
5DN1L: And how do you know your output is correct if you don't know the input?
jacek: everything test and validator are different
SalvG: I pass all the test cases, but when i submit i don't (just for some of them)
jacek: http://chat.codingame.com/pastebin/5651281d-286d-4059-801e-66aab2c477a2
5DN1L: It's also a good idea to build some small custom cases to test your code as well
SalvG: thanks @jacek, I checked the output and it is different.. but for some reason i get the green light
SalvG: and the first line of my output is "free(): invalid next size (fast)" anyone know what it means?
jacek: could be many things, for example delete already deleted pointer
BJD: taco
antiwonto: [auto] Hey BJD, here is a :taco: for loggin in today while it is quiet. You now have 18 tacos
jacek: :no_mouth:
TimothyAlexisVass: taco
TimothyAlexisVass: ?
TimothyAlexisVass: :taco: jacek
antiwonto: [auto] TimothyAlexisVass has awarded jacek 3 tacos. jacek now has 14 taco. TimothyAlexisVass now has 4 taco
jacek: :taco: TimothyAlexisVass
jacek: :*
antiwonto: [auto] jacek has awarded TimothyAlexisVass 5 tacos. TimothyAlexisVass now has 9 taco. jacek now has 15 taco
b0ot: @jacek are you the same jacek who answers all the questions on the vue discord?
jacek: i rarely go to discord
jacek: and i dont know nothing about vue
b0ot: hmm
b0ot: is jacek a name or character?
Wontonimo: he is a character and it is his name
jacek: its a name
emh: anyone spending time doing bit optimizations? my favourite
RoyDaBoy123: Hello guys. I'm kinda new to this.
RoyDaBoy123: I'm gonna need help. Will you guys help?
RoyDaBoy123: :grin:
RoyDaBoy123: :grimacing:
emh: of course RoyDaBoy123 we are standing by for help
RoyDaBoy123: thank you:sunglasses:
jacek: struct trying to bitboard search race
RoyDaBoy123: i dont really understand how to redefine the districts.
jacek: which puzzle
TimothyAlexisVass: I like to eat
RoyDaBoy123: small country
emh: jacek race? like mad pod?
RoyDaBoy123: im a beginenr
RoyDaBoy123: line 34
RoyDaBoy123: i dont know what to put
emh: I haven't looked at the gerrymandering thing
RoyDaBoy123: :sweat:
jacek: emh https://www.codingame.com/multiplayer/optimization/search-race and yes im trolling here
5DN1L: gerrymandering is a hard puzzle, probably not suitable to beginners
jacek: have you tried its forums https://www.codingame.com/training/hard/gerrymandering/discuss
emh: jacek aha hehe
emh: I visited Gdansk
emh: 2018-19 or so
emh: had my first Apferol Spritz there
RoyDaBoy123: alright ima leave
RoyDaBoy123: ima do something on codin which suits me
emh: RoyDaBoy123 take care
RoyDaBoy123: alright bye
emh: or take caret. all the way to the right. line full of code. then hit enter
jacek: nice
waterproofsodium: noice
BJD: bot
antiwonto: [auto] 'bot' was defined as ' Automaton2000 '
Automaton2000: you have to calculate the number of turns
TimothyAlexisVass: :taco: Joseph6996
NachSN: https://prnt.sc/Ujy-rOg7ijkO
NachSN: im sad
jacek: hello sad, im dad
Wontonimo: what a coincidence, i'm dad also
NachSN: 2 dads
hankthornlee: unheard of
NachSN: does that mean im adopted
hankthornlee: no, it just means you are in a progressive family
jacek: hm
antiwonto: [auto] Hey jacek, here is a :taco: for loggin in today while it is quiet. You now have 16 tacos
jacek: :upside_down:
antiwonto: [auto] ':upside_down:' was defined as ' ɥǝllo '
jacek: Automaton2000 how old are you
Automaton2000: yeah, but if you mean the above link gives you an idea of optimizing for "code of the rings" further? ...
emh: antiwonto can I have a taco?
Westicles: 1 accept and 2 rejects on my clash, this is exciting
emh: :taco:
antiwonto: [auto] ':taco:' was defined as ' A currency to some, sustenance for others '
emh: antiwonto how many :taco: do I have?
jacek: thats #taco things
Westicles: wonton says he won't port tacos to discord, a great loss for us all
Westicles: They are saying to make this a puzzle but it seems better as a clash to me
Westicles: https://www.codingame.com/contribute/view/18429f2b452ae7ee8e44b2ecf12e69e8f3960
Zorg1: :D
Ayza: I kinda agree westicles
Ayza: not everyone would be able to solve it in a clash
Ayza: not sure if it's too easy for a puzzle though
Westicles: hmmm
Westicles: Ayza, you don't have to change your puzzle pt2, sounds like my code just got lucky
Ayza: oh lol, I'll return it to ready
struct: hi
Westicles: o/
jacek: sub 11k, nice
struct: I just changed width to 10k
struct: Im gonna work on it now
struct: Im gonna try to add more angles
struct: to see if anything changes
struct: and use chokudai
jacek: is the depth fixed? youre doing eval from the same depth?
struct: yes
struct: jacek do you also have the problem where you cant use the 50ms?
jacek: im using 30ms
jacek: and still ocassionally timeout
struct: yeah thats what I used on MC I think
struct: I think I use like 11 depth on that submit
DomiKo: 30ms for me too
struct: jacek your submit is NN?
jacek: derjack's
struct: oh
jacek: playing around with parameters https://i.imgur.com/fx9pTeT.png
jacek: its validation
struct: Nice
struct: what search do you use with it?
jacek: no search, just outputs angle and thrust and clip the exceeds
kann1er: whant does i&1 mean
jacek: if i is odd its 1, if i is even its 0
SandmanSW96: should mean if the last bit of i is 1?
SandmanSW96: yeah what he said lol
SandmanSW96: same as %2
struct: nice jacek, have you ever tried eval based NN on search race?
jacek: and i dont know how to use that NN in search. it was evolved, its a complete blackbox, just outputs the continous action
struct: Can you share a replay of it?
derjack: https://www.codingame.com/share-replay/639941286
derjack: it struggles with this https://www.codingame.com/share-replay/639941323
struct: wtf
struct: why can I see your cerr
derjack: huh
struct: Collision Time: 0.3553235667148212
derjack: its not me lol
struct: wtf is this bug
derjack: its referee?
struct: oh
struct: you are right I guess
struct: I cant see your output though
struct: Very strange
jacek: euler knows
struct: yours does better on longest it seems
struct: 2 turns faster
jacek: https://www.codingame.com/share-replay/639942576
jacek: and https://www.codingame.com/replay/639941989
struct: https://www.codingame.com/replay/639943307
struct: 111 vs 110
struct: damn
jacek: i think the best i got was 108
struct: jace k uses how 37 angles right?
struct: uses 37*
jacek: and 201 thrusts
struct: o.o
struct: My bot uses 3 angles and 2 thrusts
sc6ot__: hi
struct: hi
BJD: x-=5)-(6
antiwonto: [auto] x = 1
ooliver1: h
Westicles: wtf, partial derivative of Var_1+3*Var_1^ln Gamma^cos(2*pi)*y3+y3*sin pi^4*e^Gamma
struct: is this a clash?
Westicles: ha, no a puzzle
Westicles: my puzzles get rejected because you have to figure out the formula for volume of a sphere
Westicles: "too much math"
struct: https://i.imgur.com/AGOKhN9.png
struct: this?
Westicles: :expressionless:
Westicles: https://www.codingame.com/training/hard/derivative-time---part2
MSmits: I guess you cancelled your plans for a donut puzzle
Westicles: you have to code Wolfram Alpha to solve this thing
Westicles: I was doing a donut puzzle?
Westicles: I guess my clash that is getting rejected is on a torus...
jacek: "Louise is learning calculus in her maths courses and she likes the idea" w00t
struct: nope math is not for me, but I dont have a problem on puzzles having them
struct: is not like I have to solve all the puzzles
struct: I dont even do puzzles
jacek: you just make them
MSmits: i was kidding Westicles
Westicles: maybe I'll skip this one. the #fr big 3 have stopped doing puzzles, probably over the chat thing
Westicles: big 2?
Wontonimo: body shaming is not cool Westicles
Westicles: :P
Wontonimo: haha
Wontonimo: what's the chat thing?
struct: being removed I guess
Westicles: moving chat to a site they can't reach from work, where they usually spend the whole day chatting here
Wontonimo: i thought maybe there was something else
struct: top 20 finally
struct: I think Im done with this
Wontonimo: and the end of chat has been chatted about for about half a year ... and it's always been 2 weeks away
Wontonimo: what did you do to get there ?
struct: just beam search
struct: with dynamic depth
Wontonimo: fancy
Wontonimo: what's the logic around dynamic depth (as opposed to growing width)
struct: well I start with a big width but search deeper
struct: with growing width you will repeat the early states too many times I think
Wontonimo: so, you just have a fixed width and grow the depth until you run out of time ?
struct: yes
Wontonimo: classic beam search then
MSmits: yeah that's just beam search
Wontonimo: can i see a replay of hold the line ?
Wontonimo: using your beam search struct
struct: 1 sec
struct: https://www.codingame.com/replay/639966050
Wontonimo: yup, that's how it's done. my stupid GA can't figure it out
struct: my monte carlo did very poorly too
Wontonimo: ah beam search, a 1970's algo wins the day.
struct: https://www.codingame.com/replay/639966447
struct: managed 107 here
Wontonimo: nice. gas gas gas
darkhorse64: BS with 3 angles and 2 thrusts ? That's 6 different outputs. You can get by with 5
struct: oh right
Wontonimo: i don't see how
Wontonimo: turning with and without thrust is different
darkhorse64: angle 0, thrust 0 is useless
Wontonimo: ;( i fail
Wontonimo: oh, because there isn't a rudder effect
struct: ty darkhorse64 sub 10.9k now
struct: its very weird that sdk doesnt let you use full time here
struct: I wonder what magic illedan did
darkhorse64: My best solution is also a BS but my eval probably sucks. He he, I talk too much. I have the same timeouts issues
struct: my bot still does something weird on last checkpoint for some reason
alxdip123: maybe because the checkpoints are so close to each other that it interferes with your logic
j4at: Eh, how to run search race locally ? Do I need to rewrite it? because it doesn't work with cg-brutaltester
antiwonto: [auto] Hey j4at, here is a :taco: for loggin in today while it is quiet. You now have 7 tacos
j4at: well cg-brutaltester is to simulate multiplayer arena. So its not the write tool.
j4at: right* lol
struct: https://github.com/Illedan/CGSearchRace/blob/master/SearchRace/src/test/java/SkeletonMain.java
struct: You can add your bot there I think
struct: check line 19
jscarle: The clashes that are size based don't play fair against all languages.
j4at: ty, struct :)
jscarle: Is there a way for this not to open a new chat window for every clash?
b0n5a1: yes wait a few days...the chat will no longer exists :D
Aldo_Baldo: i just started playing but i think i'm addicted now..
Netsmile: where will the chat go?
Netsmile: this right hand panel will dissapear?
struct: yes
struct: It will move to discord...
Netsmile: cool
Char1i3: is there a way to complete a clash after the timer runs out? I'm still learning so can't always finish in time but would still like to finish for the practice
struct: https://eulerschezahl.herokuapp.com/codingame/puzzles/
struct: search it there
Char1i3: thanks for that
jscarle: Python = 63 characters
C# = 164 characters
jscarle: Impossible to win
SandmanSW96: lol c# in golf is futile, i use it to practice Linq anymore
AlMag: they refer to CoC. I also hate "shortest mode" one liners where python always wins
SandmanSW96: clashes were a bigger deal but now they're still pretty handy to just get practice, work on new and/or better ways etc
Mehdi_Maesta: i agree with you
Aldo_Baldo: why is that so?
jscarle: There are substantial differences in syntax between languages which makes C# impossible to compete with Python for shortest code.
jscarle: CoC should be constrained to developers using the same language.
jscarle: For example, Python can use input() and print(). C# MUST use Console.ReadLine and Console.WriteLine.
jscarle: Right there makes the rest impossible.
jscarle: Not to mention that C# is strongly typed and Python is not.
jscarle: So whilst Python can do v = 0, the bare minimum for C# is var v = 0;
Aldo_Baldo: yeah sure, i meant why
> it was a bigger deal
and then it became less popular?
Westicles: all right, we moved you to the top of the list
Westicles: https://www.codingame.com/events/271d9f031eebaa66dc17d58ef83ac3f7431
DraH: taco
Tbone1212: Does anyone know how to fix getting an error that was from a previous code
Wontonimo: submit new code
Tbone1212: Well it is a completely new challenge and there is no text but its just blank space underlined with an error that clearly isn't there
AryanTripathi: well something unfair happened with me
antiwonto: [auto] Hey AryanTripathi, here is a :taco: for loggin in today while it is quiet. You now have 2 tacos
AryanTripathi: I just won 3 clashes consecutively but still my achievement isn't completed
AryanTripathi: sed life
AlexCibotaru777: my brain is melting with this code
AlexCibotaru777: i can't do anything
AlexCibotaru777: apparently im too dumb for coding.
TuiTeeraphat: hi
