Chat:World/2022-06-07
BamaDoes: taco
Tien118: hi
Tien118: taco
Tien118: ?
5DN1L: Typing "taco" will not get you any tacos normally
Tien118: :(
smhb: please... taco
5DN1L: Automaton2000, wanna use your Markov chain some more?
Automaton2000: as you can see the code
5DN1L: Hmmm, a gerrymander solver puzzle on codewars: https://www.codewars.com/kata/5a70285ab17101627a000024
5DN1L: quite different from the puzzle here
MrBlueBird2: sup
MrBlueBird2: why is alex1 not active from 2 years
MrBlueBird2: I haven't seen him coding or being online
Uljahn: ah, you mean Alex-1
MrBlueBird2: yeah
MrBlueBird2: what happened to him?
5DN1L: You've seen many people come and go, right? Automaton2000
Automaton2000: i'm still waiting for his colleagues' feedback
derjack: :upside_down:
antiwonto: [auto] ':upside_down:' was defined as ' ɥǝllo '
derjack: :taco: Uljahn
antiwonto: [auto] derjack has awarded Uljahn 10 tacos. Uljahn now has 34 taco. derjack now has 45 taco
TechTheAwesome: :eyes:
MrBlueBird2: :eyes:
TechTheAwesome: tack?
TechTheAwesome: taco*
MrBlueBird2: :eyes:
5DN1L: Typing "taco" usually won't give you any tacos
MrBlueBird2: what even is taco
TechTheAwesome: can it do code for me?
5DN1L: just-for-fun feature
MrBlueBird2: ohh
5DN1L: it can't
TechTheAwesome: aww :P
MrBlueBird2: *dies of cringe*
5DN1L: you may join the current puzzle event if interested: https://www.codingame.com/events
Westicles: Alex-1 has a new name
Westicles: You can find him on the contrib page
MrBlueBird2: what is the name????
MrBlueBird2: ROBIN HOOD?????
Westicles: hii
MrBlueBird2: hiii
TechTheAwesome: @5DN1L puzzle joined :D
5DN1L: nice
Uljahn: :taco: derjack
antiwonto: [auto] Uljahn has awarded derjack 10 tacos. derjack now has 55 taco. Uljahn now has 35 taco
MrBlueBird2: :taco: derjack
antiwonto: [auto] Sorry MrBlueBird2 but you need 3 tacos to give tacos. You have 0 now. Get someone to give you more tacos first
MrBlueBird2: sed life
galuso: Process has timed out. This may mean that your solution is not optimized enough to handle some cases.
antiwonto: [auto] Hey galuso, here is a :taco: for loggin in today while it is quiet. You now have 1 tacos
galuso: http://chat.codingame.com/pastebin/c11ded5b-514f-4aae-9d02-e51c11810c79
galuso: and the reqest is the followeing:Display the total number of vowels present at odd indexes in the given string.
5DN1L: you haven't counted uppercase vowels too?
5DN1L: maybe that's the issue?
TechTheAwesome: infinite loop?
TechTheAwesome: doesn't look to be one
TechTheAwesome: wait is it `i+2` or `i+=2`
Baipyrus: thats probably why it loops infinitely
TINOUAINANI: Hi
MACKEYTH: Hi
S1syphe: Hello
MAWAAW: hi taco for everybody
Brawler_zx: any one who uses c++?
antiwonto: [auto] Hey Brawler_zx, here is a :taco: for loggin in today while it is quiet. You now have 1 tacos
struct: yes
Brawler_zx: I get input using getline(cin,s); If I use s.size() will this work?
Brawler_zx: I am getting some unwanted length
struct: it should work
Ollle: With Mad Pod Racing, is the value you give to thrust the amount of units it moves per turn? Or what is it?
Brawler_zx: Ok i'll checck my code again
struct: Ollle it will change your pod velocity
Ollle: and how much does it slow down per second or per turn
struct: it has .85 friction
struct: http://files.magusgeek.com/csb/csb_en.html#4-3-applying-the-thrust
DaNinja: yesss, solved Freecell
struct: grats
AryanTripathi: how do i get taco?
Tien118: hi
Tien118: taco powers
antiwonto: [auto] That taco command has moved to the #taco channel
zakacat: give :taco: AryanTripathi
antiwonto: [auto] zakacat has awarded AryanTripathi 1 tacos. AryanTripathi now has 1 taco. zakacat now has 31 taco
Reyil: hi
AryanTripathi: yayay
AryanTripathi: I scored 54% on my python test
AryanTripathi: this was my second attempt
AryanTripathi: last time I scored 0%
AryanTripathi: lmao
5DN1L: good, try to get 100% next time!
VN~Minh4893IT: congrats
AryanTripathi: thenk
AryanTripathi: thenks
AryanTripathi: sure I will try to get 100% next time
struct: hi
AryanTripathi: hiii
VN~Minh4893IT: do your best, aryan
AryanTripathi: <3 thenks
Comrade_Elmo: elmo's gonna dance FOR THE MOTHERLAND
souta_1326: 10 wins in a row on CoC :v:
TheRipperJack: nice
TheRipperJack: lol i clashed 50 times today and site asked me to verify am i human
draco-the-dragon: http://chat.codingame.com/pastebin/9b14c5be-21d4-4eff-b1d3-1a3ffcc50b0b
5DN1L: Didn't expect anyone to write in Japanese here. Not to say non-coding related Japanese text.
5DN1L: Don't do that again draco-the-dragon
TechTheAwesome: i think its a lyric of a song?
TechTheAwesome: https://genius.com/Akb48-koisuru-fortune-cookie-lyrics
5DN1L: please let's not drill into that
Troph: Hi everyone, I am stuck with langton's ant bot programming and would like some pointers. I am doing it in python and can only do 1.000 random simulations with a very basic algorithm. I don't know where to start to improve it
eulerscheZahl: which programming language?
5DN1L: he said python
eulerscheZahl: oh, reading skills...
eulerscheZahl: sorry
eulerscheZahl: i get around 45-50k in C#
eulerscheZahl: i'd say porting to C# can get you around 20k at least. porting to C++ and your sims are on par with mine
eulerscheZahl: oh wait, we have different map sizes in this game
eulerscheZahl: i don't think, that this game has any shortcuts to significantly speed up the simulation
eulerscheZahl: i can just provide reference numbers: 20k-ish for 34x34 map size and 132 turns https://www.codingame.com/share-replay/639704180
Troph: Doing it in C I can do around 25k simulations, but I see people above me using python so I am wondering what I am doing wrong
eulerscheZahl: what i do: compute the next few empty cells, that the ant will pass. only allow to play there and not anywhere
eulerscheZahl: then minimax me vs opponent
Troph: I am not even at the fighting the opponent on the same board stage
eulerscheZahl: oh right, first leagues are single player
Troph: Stuck in wood 4, using C I could go up, but I'd rather fix it before
eulerscheZahl: i struggled harder with those than i should have. passing with simulation and then adding minimax put me quite high already
Troph: what I do is I generate random moves, then simulate the ant's move and keeping the sequence that does the best score
StevenV: wow wood5 the first time I see this
eulerscheZahl: try to only simulate empty cells which you will pass (and probably which are somewhat early in your path)
Troph: hmmm, that could be indeed a solution, I'd need to switch to a completely new approach
brianna-the-Astrophile.: hey guys sorry for intruding in the wold chat but do any of ya'll know how to How do you reverse a string in Java? im forgot and its confusing
5DN1L: https://letmegooglethat.com/?q=How+do+you+reverse+a+string+in+Java
eulerscheZahl: l like the stringbuilder idea from https://www.javatpoint.com/how-to-reverse-string-in-java
StevenV: new StringBuilder(str).reverse().toString()
eulerscheZahl: switch to python and do string[::-1]
brianna-the-Astrophile.: thank you guys
TINOUAINANI: Hi how you can use coding game plug for vs code ?
Comrade_Elmo: Hello. I am sorry for posting non-code related stuff into the chat. I was not aware that this was not a chat to be posting that kind of stuff. I will never do it again. I am truly sorry. :'(
5DN1L: Thank you
TechTheAwesome: :eyes:
jacek: Troph do you use pragmas to compile C code in release mode?
darianleking: shut up
kenaubry: cheh
5DN1L: kicked out :shrug:
Troph: jacek I do not know what pragmas is
struct: https://gcc.gnu.org/onlinedocs/gcc/Optimize-Options.html
struct: This is what I use
struct: #pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
- pragma GCC option("arch=native","tune=native","no-zeroupper")
- pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,bmi2")
struct: If you paste it on top of the file it should work
struct: The last one should not be needed I guess
struct: Without Ofast I go from 3Mill to 300k sims per second
Troph: oh, that will really improve my C code
struct: I use it on c++ but I think it should also work for C
jacek: it should be pasted above #includes
struct: Finally reached 4M sims but same rank ...
jacek: stc?
antiwonto: [auto] 'stc' was defined as ' Smash The Code https://www.codingame.com/multiplayer/bot-programming/smash-the-code '
struct: I meant rollouts
struct: on c4 but was only 1 game
struct: I think my bot must be bugged
jacek: 10x faster should be noticeable better no matter what
struct: yeah but its not 10x its 20x
jacek: :scream:
jacek: by now it should emerge self-consciousness
struct: 20x should not be 0.5 elo dfference
jacek: trueskill*
struct: on the leaderboard
struct: ok trueskill
jacek: when i first added pragmas to uttt, i went from bottom of legend to top 25%
jacek: that was 3x faster
jacek: woah im 3rd
struct: I would check c4 but I rather spend my time elsewhere
struct: I wont learn much form rewriting it anyways
struct: jacek would ttt be a good place to start to apply a NN or do you think its too hard?
jacek: yeah, its good to start
jacek: although ttt requires surprisngly many nodes or layers to play perfectly
jacek: maybe hexapawn would be easier
struct: 3x3 breakthrough?
Akex06: hey
jacek: not exactly as you can diagonal only to capture
struct: ah I see
j4at: I gave up on my spider attack NN. I made it work but the problem that it so big(21.5m paramaters for the actor) and slow for CodinGame :p Size is very important for transformers. Shrinknig it makes it very bad.
struct: j4at you could try on a simpler game I guess
struct: When I'm able to make it work I would choose breakthrough
struct: I will choose*
j4at: Well, I can try with another NN architecture. I will try a simpler game first. Any suggestions ?
struct: Yes, breakthrough, oware
struct: or onitama
struct: but jacek has more experience on this
struct: Maybe he can suggest one
j4at: okay, ty :)
jacek: oware would be simplest
jacek: or you could try this actor-critic thing in single player - search race
DomiKo: I believe that every simple game for NN have one common flaw. It's hard for you to understand if your boy is doing something meaningful
struct: DomiKo even on bt?
struct: its an easy game to check if your bot is doing poorly or not imo
DomiKo: OK deciding if it's completely trash or not isn't that hard
jacek: thats what leaderboard is for
struct: well on breakthrough there is only two types of bots, trash and not trash
jacek: thats why i like CG - i can see if my bot is good, at least not crap
DomiKo: Worst when you see that your bot is bad, you don't know why
jacek: because you copied your brain into NN :v
j4at: Search race seems perfect :)
j4at: I will give it a shot
DomiKo: Yeah, storing entire brain in some linear layers isn't the best idea, I guess
DomiKo: And one question in Oware P1 loses? or draws?
jacek: my alt is 27th, and this is NN
jacek: normal oware is draw. maybe turn limit changes that
DomiKo: ok thanks
emh: hmm I have some fast bitfiddling algos for StC but I never got around to submitting a bot with it
struct: derjack is also NN jacek?
emh: struct what's your optimized numbers for StC on flood fills?
struct: Not that much
struct: I get like 1M random plays per turn
emh: ahh ok
struct: but 1M with pieces drop and floodiflls
struct: so 1M moves
emh: with regular flood fill I get around 400k, with bit optimized 1.6M. but that's just the floodfills. and lonesome pieces are removed with a bit operation first
emh: on my laptop that is. should check online
struct: I get like 50% of what I get locally
emh: ahh ok. I got 1M instead of 1.6M online
struct: but floodfills or moves?
emh: floodfills only
emh: so yours seems fast
emh: but it depends how densely I populate the random matrices
struct: I do normal floofill
emh: ahh ok
struct: but there is a few optimization you can do
struct: to not use it as much
struct: I only check floodfill on pieces that were affected
eulerscheZahl: now you just have to find a way to utilize your sims and climb the ladder
emh: I see
emh: hehe yes euler
struct: also I take into account color count of each piece
struct: maybe if you divide it into regions it can also help
struct: But I dont do the 2nd part
eulerscheZahl: i don't try a flood fill, if there are only 3 of that color on the board. is that what you mean?
struct: yes
eulerscheZahl: there was a time when i was trying hard
struct: I only try to floodfill if there is more than 3 and if the piece moved
struct: either it was placed or if it dropped after a piece was removed
eulerscheZahl: i have that too
emh: I have a bitboard per color
eulerscheZahl: and here i'm out, no bit board for me
eulerscheZahl: marchete does
struct: I also only add if it has a neighbor next to it of the same color
struct: But that is probably not neede
eulerscheZahl: doesn't sound that color to me
emh: I wrote my bit stuff for StC at https://tech.io/playgrounds/5f1a3b2bee0e0fc11ee2d14e0fc3a40983085/fast-connected-components-for-6x12-bitboard long time ago
struct: I think marchete tried avx here if im not mistaken
emh: ahh sorry
emh: that link was wrong
emh: here is it: https://tech.io/playgrounds/58038/fast-connected-components-for-6x12-bitboard
eulerscheZahl: half of my time is used for eval anyways
struct: My performance is similar to the grid one
eulerscheZahl: but one version is more likely to break at some CG update than the other
struct: update whats that?
eulerscheZahl: i rare this that happens right before a [contest](definition missing)
emh: with average 10 bits on the board or so I get 2.3M flood fills on CG
MSmits: DomiKo yeah normal oware draws and it is very likely the turn limit does not change that.
struct: how do you count floodfills emh?
MSmits: also there are many routes to a draw.
eulerscheZahl: 5 colors? => 5 flood fills per turn
emh: struct a board of 6x12 bits, split into its connected components (one 6x12 bitboard per each)
eulerscheZahl: only 1 stone of a color? fast flood fill
emh: eulerscheZahl yes I have to do flood fill per color
emh: 5 per turn yes
struct: Ok I do it individually per bit that was changed
struct: Maybe I should change that
struct: Maybe I should write eval first instead of wasting time on this...
eulerscheZahl: no. that's your signature move: optimizing performance but close to no eval
struct: found this while looking for hexapawn, it might be useful for someone I guess, I havent read it yet but I think I will https://github.com/asdfjkl/neural_network_chess
struct: on the 5th chapter it applies A0 to hexapawn
struct: or similar to it
eulerscheZahl: a donate button on github? is that even allowed by their terms of service?
struct: no idea lol
webDeveloper87: Are there books has this problems and its solution?
eulerscheZahl: which problem?
eulerscheZahl: context needed
jacek: http://chat.codingame.com/pastebin/befbf757-5f18-42b0-ba33-c7114e013e26
jacek: i think you can do it with smaller network
struct: seems a bit overkill yes
jacek: for the record, i use at most 2 hidden layers on cg
BristerMitten: hello
MSmits: github has their own donate button for sponsorships
MSmits: not sure if they allow a button you make outside of their sponsorship system
MSmits: but they dont take a cut from their system so i dont see why it would be a problem
struct: well tbf if its not allowed they are not doing enough checks I guess
struct: They can filter a paypal link easily
eulerscheZahl: maybe i'm just annoyed from all the youtubers promoting NordVPN and whatever. and now i see a donate even on github and wish it wasn't allowed
MSmits: :moneybag:
MSmits: :money_mouth:
struct: ill put my bots there and a donate button
struct: oh wait no one wants them
eulerscheZahl: hosting a somewhat popular puzzle search with a github link for maybe a year now. 13 stars on github
eulerscheZahl: almost no one even clicks that github code link
jacek: https://cdn.discordapp.com/attachments/733556241493917766/979026027760193637/True-King.jpg
eulerscheZahl: :D
eulerscheZahl: oh wow, i have 59. how did that happen?
struct: jacek has a meme for everything
struct: im impressed
xyz-1: anagram
jacek: :thinking:
webDeveloper87: are any one solve piling boxes before?
5DN1L: Any link to your problem and what is your question?
webDeveloper87: I want answer of it
webDeveloper87: I don't have a link
5DN1L: "What is your question?" "My question is: what is your answer?" Does that count as recursion?
benia__yahia: https://www.codingame.com/clashofcode/clash/24466124466ea35d542c8cc22ef0a0ac6406364
antiwonto: [auto] hey benia__yahia dont paste those links here. Use the channel #clash
webDeveloper87: I know only the name of question piling boxes
Forsaken_Ch1ld: Very beginner question, is there a page on how to post to the forum? And what I mean by that, I can't for the life of me figure out how the bbcode works within the forum.
Forsaken_Ch1ld: Yes I know how to post to the forum just not style my output.
jacek: maybe ask that on the forum :v
jacek: its pretty much like word or libre office. you have buttons above the text field
5DN1L: this may help: http://commonmark.org/help
Westicles: oh jeez, they are going to approve another derivative puzzle
antiwonto: [auto] Hey Westicles, here is a :taco: for loggin in today while it is quiet. You now have 79 tacos
jacek: do you feel different?
Westicles: just a small difference
jacek: woah and mines and minions in contribution
Westicles: all the new puzzles are either math or the 500th BFS. people are out of new ideas
struct: just wait until I port a brand new multi that requires MCTS
DomiKo: another copy paste top10
struct: I must finish porting backgammon
struct: Might be harder to copy paste there
Westicles: maybe my monkeypox class will inspire a new generation
Westicles: *clash
jacek: generation of human monkey kids?
Westicles: we'll never have these high quality conversations on discord.
jacek: :(
Westicles: One more approval needed
Westicles: https://www.codingame.com/contribute/view/8267edd6987c0f3053f5e43e58d6ec37b908
jacek: try this https://www.codingame.com/contribute/view/740203e8fd13958f2004c080451ccdb25250
Westicles: can't read all that
Ayza: is it worth making a part 2 of this https://www.codingame.com/training/easy/survey-prediction
Ayza: where there could be people of the same gender and age but different genres
Ayza: and more data
Ayza: (or in the same age range)
Westicles: sure, why not? those two 1-star ratings were just cranky fr guys
Ayza: thought it wouldn't be too much of a change, now I can get into it
Ayza: and yeah these two 1 stars are strange
Ayza: you gotta solve the puzzle to rate it right?
Westicles: no. just run a test case
Ayza: oh that explains it
Westicles: probably triggered by only having 2 genders.
jacek: :rage:
Ayza: forgot to add the 100 other genders
jacek: but long can only so many different values
Special_coding_operation: :two_men_holding_hands:
Special_coding_operation: :family_wwb:
jacek: :upside_down:
antiwonto: [auto] ':upside_down:' was defined as ' ɥǝllo '
mdfarhansadiq: hi
waterproofsodium: gm
waterproofsodium: joguk
waterproofsodium: was here
VN~Minh4893IT: give taco for me pls
VN~Minh4893IT: i want to get some tacos
j4at: :taco: VN~Minh4893IT
antiwonto: [auto] j4at has awarded VN~Minh4893IT 1 tacos. VN~Minh4893IT now has 1 taco. j4at now has 6 taco
VN~Minh4893IT: thanks a lot <33
TheLumpySconeMachine_7e79: hello
smhb: whats the taco about?
AdrianC9: i have depression lol
DraH: taco
TheLumpySconeMachine_7e79: who play empire of code here
AryanTripathi: finally completed my first contribution
TheLumpySconeMachine_7e79: i have a problem with promo code
Westicles: AryanTripathi, you aren't supposed to have binary outputs
antiwonto: [auto] Hey Westicles, here is a :taco: for loggin in today while it is quiet. You now have 80 tacos