thanhhv317: hello everyone
Laminator: which one? lol
codeing: hi gays
codeing: tell me there #codeing
codeing: what you think about this puzzle
codeing: that's my answer
codeing: waiting answer there #codeing
codeing: is my code complexe ?
jacek: happy Caturday
Shrimpster: any free python bootcamps yall can recommend? My little brother is starting to code
Neumann: Are you guys using Beam Search in the top 8 of 2048 ?
eulerscheZahl: you should ask that on #ru
eulerscheZahl: i don't understand a word but they are actively discussing it by the numbers i see there
geppoz: i dont know how it is called,
geppoz: i create a full tree of a certain depth, say 8
geppoz: then i evaluate all the leafs, choose the best and i go up the tree for some steps, then i restart from there
geppoz: with that, i am above Euler :D
eulerscheZahl: (╯°□°）╯︵ ┻━┻
geppoz: that's enough for me :D
eulerscheZahl: what to expect next (not an optim): https://prnt.sc/v12mud
geppoz: that method of mine has a name?
eulerscheZahl: sounds a bit like beam search
eulerscheZahl: yet different
eulerscheZahl: and i doubt it's more effective than a regular beam search
geppoz: the difference would be to choose a set, not a single one to restart, right?
eulerscheZahl: and not go back multiple steps
eulerscheZahl: list of boards => expand all take best n
geppoz: expand all => 1 step only?
eulerscheZahl: give it a try
geppoz: i think that requires a very good scoring evaluation
geppoz: while going deep allows good results even with poor score eval
eulerscheZahl: it's not much different to what you do
eulerscheZahl: going multiple levels deep is the same as having a wide beam
eulerscheZahl: that is keeping many nodes
Neumann: What's your BS width euler ?
eulerscheZahl: you don't have to print everything up to the final node at the end
eulerscheZahl: const int searchDepth = 30;
const int printDepth = 30; const int beamWidth = 100;
Neumann: You must have some fancy eval function
eulerscheZahl: double result = 0;
result += Grid[0, 0]; result *= 9; result += Grid[0, 1]; result *= 9; result += Grid[0, 2]; result *= 9;
eulerscheZahl: and so on, forming a snake
eulerscheZahl: i dont even score the game score
eulerscheZahl: just the number on each tile with different factors
eulerscheZahl: rewarding a large number in the corner
geppoz: fixed snake? i did double sided snake
eulerscheZahl: fixed for me. Ille has 2 snakes as well
geppoz: what means printDepth?
eulerscheZahl: i should also score "movability" only a single legal action that is RIGHT is deadly for me
eulerscheZahl: tried not to print all of my plan
Neumann: Why the top left-corner would reward 6561 times more than the bottom-left corner ?
eulerscheZahl: to recover from that RIGHT-only
eulerscheZahl: if that's 9^4, then yes
Neumann: I don't understand the logic of your eval :D
Neumann: Favor tiles stacked in a corner, ok
eulerscheZahl: did you ever play by hand?
Neumann: But why a corner more than another ?
Neumann: A bit yes
eulerscheZahl: give me a moment to make a screenshot
eulerscheZahl: i reward snakes
Neumann: That I can see. But what if your screenshot was inverted, center-rotation
Neumann: Same board value
Neumann: Very different eval result
eulerscheZahl: for me it's the top left. but that's completely arbitrary
eulerscheZahl: just take 1 corner and stick with it
geppoz: the important think is you dont reward two corners in the same board
geppoz: eval the "direction" of the board, and reward only toward any corner
geppoz: i do it for the two top corners
Neumann: brb stealing your idea
eulerscheZahl: i see you beating me soon
geppoz: i still didnt understand what do you mean with "print" depth
eulerscheZahl: while my beamsearch knows my plan for several turns, i don't print all of them
eulerscheZahl: you go some levels deeper to detect a dead end and go back up
eulerscheZahl: i just don't print everything
Neumann: How did you came up with that eval ? You figured out the game ? That's pretty smart
eulerscheZahl: too much playing by hand
wlesavo: Neumann yeah, mostly beamsearch with snake eval, at pure bruteforce with depth 7 i was at 28M
wlesavo: i think anyone who played the game came up with the same eval separately, which is pretty funny actually
codeing: hi gays tell me there #codeing what you think about this puzzle that's my answer
Astrobytes: again codeing?
codeing: i'm shaked
AntiSquid: codeine ?
AntiSquid: (pain drug)
Astrobytes: I know, it take it 4 times a day
codeing: why pain drug ?
AntiSquid: because that's what it is
Astrobytes: codeine and codeing, different by 1 letter only
AntiSquid: Codeine is an opiate used to treat pain, coughing, and diarrhea.
codeing: codeing == code in present continuous
codeing: so code ing
Astrobytes: You drop the e
AntiSquid: codeing is like short for treating pain with codeine
AntiSquid: the perfect verb for it
Astrobytes: "every day I'm codeing"
codeing: sure ?
Astrobytes: totally untrue actually
Astrobytes: anyway codeing, why are you showing everyone that code from hell again?
codeing: Astrobytes how is this code the hell ?
codeing: make me feedback there
Astrobytes: we gave you feedback on it last night
codeing: you rigth
Astrobytes: remember? Hard to read, inefficient, extremely verbose
codeing: what verbose ?
Astrobytes: You asked that last night too
codeing: was tired
Astrobytes: In this case, more code than required
Astrobytes: Tiki69: https://lmgtfy.app/?q=minimum+adjacent+swaps+array
Sylarb91: can anyone guide me on the temperatures puzzle ?
jrke: in temperatures you have to output nearest int to 0
jrke: means minimum absolute value
Sylarb91: i already did that... let me be more specific
Sylarb91: i fail on the 3rd and 5th test because i dont know how i can output the positive value
jrke: use if else
Neumann: wlesavo: How would you reach 28M with depth 7 ? 7 moves per turn doesn't allow you to get that high. Did you do several depth 7 BF per turn ?
geppoz: +1 (me too dont get that)
jacek: what do you mean by restart
wlesavo: Neumann yeah, several, you need around 30-40k moves, so once you reached depth 7 you add moves to the pool and continue the search
Neumann: 4*depth7 give me WAY LESS score than you
wlesavo: its for 3 actions actually
wlesavo: but there was some tuning involved for sure
Neumann: 3 ? as in depth 7, then cut the at depth 3 and regrow from that ?
eulerscheZahl: UDL, no R
eulerscheZahl: or whatever fits to the shape of your snake
wlesavo: yeah, what euler said
wlesavo: and also what you said :slight_smile:
eulerscheZahl: was Ille's idea initially
eulerscheZahl: meanwhile I uploaded my next brainfart :imp:
Neumann: Is that even a thing ? Ignoring one direction
wlesavo: yeah, after he claimed 3 actions is enough for 40 mil i tried that
wlesavo: actually now we know its enough for 50m
wlesavo: Neumann i was also sceptical to that
jacek: what a ripoff of other puzzle
wlesavo: well the real deal is to solve all of the 14 test with 131k's
jacek: i love the windows 98(5?) graphics
jacek: but isnt it copyrighted or something?
AntiSquid: excuse me i got 39k first with doing just ULR . Automaton2000 say somthing
eulerscheZahl: i even downloaded a virtual box disk for that
Automaton2000: i hate when that happens
eulerscheZahl: i think it's save to call it abandomware
jacek: there is 4:02 PM in the corner. can you make it to show actual time of the replay? :v
AntiSquid: but technically what you need to check for is that you keep the highest number in a corner for as long as possible so if you can move any direction as long as you don't move your highest
eulerscheZahl: wanted your ideas for some nonsense desktop icons
eulerscheZahl: but i like the clock idea
wlesavo: euler what about n-dimensional minesweeper? :smiley:
eulerscheZahl: finally a use-case for the three.js library
eulerscheZahl: as in: stupid programs that fit in the time
eulerscheZahl: like browser toolbars
jacek: daemon tools or winamp
AntiSquid: add a desktop icon with random anime avatar and text: secretly a fan
eulerscheZahl: leave me alone with your anime
jacek: yeah, use ponies instead
AntiSquid: gross ... bronies are weird
eulerscheZahl: maybe some torrent program
eulerscheZahl: or a napster link
AntiSquid: maybe a "my little pony" avatar with the text "dark web" underneath ... yeah sure
AntiSquid: outdoor cam desktop item !
eulerscheZahl: or good ol' winrar
AntiSquid: or "neighbour's backyard cam" ?
AntiSquid: is this just for the cover image euler ?
eulerscheZahl: for the background of the game
eulerscheZahl: messengers, of course!
AntiSquid: oh yes limewire ! the first best source of viruses !
AntiSquid: mcaffee antivirus internet explorer 4
if you are going for crappy old stuff
eulerscheZahl: how do i go online and download things? it tries to detect my modem
jacek: delete system32
AntiSquid: sure i have a drive with a bunch of system32 on it just so i can delete when whenever i see that comment
AntiSquid: delete one *
jacek: linux hasnt system32 and see how fast it is
AntiSquid: out of curiosity what do you use jacek?
AntiSquid: also windows has bloatware so your comparison is unfair
jacek: arch linux
AntiSquid: upgrade to black arch now
Illedan: Oh, Minesweeper contri :O seems fun
eulerscheZahl: i still have to fix the system clock. it's stuck :D
Illedan: Do it in JS?
Illedan: Would be very cool if you added a dummy start menu to :D
eulerscheZahl: when you load the replay, it already shows the correct time
eulerscheZahl: that part is done in JS
jacek: while youre at it, why dont you make fully functional windows 98 in js
Einwickler: jacek like this: https://98.js.org/
Illedan: wow, some people have too much free time
Einwickler: there is a ms paint on github somewhere too
jacek: ohh and it has minesweeper
jacek: no need for VM now
Illedan: euler stole it from there :O
Einwickler: Oh boy I just figured its the same guy who made these
Einwickler: But thats my favorite: https://1j01.github.io/pipes/
BiMathAx: Hello, what do you think of my new contribution ? https://www.codingame.com/contribute/view/5581506ad04331f4020bef765773d3759587
DomiKo: I think that statement is too long
jacek: you read statements? :o
DomiKo: but i can see that it is long
DomiKo: ohhh that's English + French
BiMathAx: It's because she is in English/French
DomiKo: now I don't know if that's legal or not
jacek: its a crime
DomiKo: French could be crime
eulerscheZahl: AntiSquid did you just self-upvote your comment?
AntiSquid: it's a good comment
DomiKo: own comment is always good one
eulerscheZahl: that would be a good comment if i would have written it DomiKo
AntiSquid: btw i still remember the order on every machine was: My computer, recycle bin, network
jacek: what is the round limit in checkers? 300?
Laminator: isn't it infinite if both sides get kings?
jacek: on CG
AntiSquid: it's never infinite, one of the players would die in real life before the game ends .
Sylarb91: imagine that happening
Sylarb91: a game from childhood till burrial
MSmits: Laminator you can have multiple kings in checkers and if you have more kings than your opponent you will usually win
MSmits: you do get some extremely long solved wins though. I think with more than 10 pieces, some solved games have a PV of 400+ turns
MSmits: so that's the fastest you'll win in those cases
jacek: i see there is 300 turns limit
MSmits: yeah, so in CG the solved wins/losses/draws are different
MSmits: well.. only in the sense that some won games will be draws
MSmits: all draws will still be draws
MSmits: this is reflected on the leaderboard btw. Way too many drawn games.
MSmits: also because these end games are so long, the searches cant find a route to the win even if it does exist, so you get silly loopa
MSmits: if someone ever makes a chess game, this will be far worse even.
MSmits: needs a point win rule. if you're ahead by x points it's an automatic win. Otherwise way too many games will get stuck even though it's obviously a win for one side
jacek: nah, in chess it is more complicated
MSmits: what is
jacek: points and the endgame
MSmits: I mean I know the game is more complicated and material isnt everything, but after 300 turns, the game is likely stuck in a loop
MSmits: you could make it +15 point difference for the win or something
MSmits: and you dont apply the rule until after 300 turns
MSmits: in real chess tournaments there is a referee making a decision like this also
MSmits: well the one i was in when i was young anyway
PatrickMcGinnisII: start making baby pawns at turn 200, heh
MSmits: lol wut?
PatrickMcGinnisII: bored pieces make babies
MSmits: sounds like i've been playing chess wrong
jacek: thats cheese
Allis: @MSmits Not necessarily "stuck in a loop", but threefold repetition of the position is very likely to have occurred by move 300.
MSmits: mmh true
jacek: dunno. detecting 3-fold repetition would be pain
PatrickMcGinnisII: drop random glasses of beer, drunk pieces can bend the rules
Allis: I would be shocked if there weren't a chess position hashing algorithm by now.
jacek: zobrist eh
jacek: hmm my checkers bot seems to be working bugless. move representation was pain
Allis: What'd you use?
jacek: for now, negamax
eulerscheZahl: finally, my clock is working
PatrickMcGinnisII: No Stress Chess would work, no repeated moves checks. level 1, 1 card, level 2 3 cards level 3 5 cards, yup that would do it
MSmits: jacek yeah... checkers is a pain to simulate with the jumps
MSmits: oh and eulerscheZahl grats on fixing time. Though without you my vacation would never end :(
MSmits: sorry, responding to some old chat :P
MSmits: I had new ideas about oware endgame books
MSmits: turns out even though you need a different result for each turn because of the limit, they have patterns. So i can save a bunch of time
MSmits: and I can keep generating the endgame book while still on my opening book
MSmits: maybe if I use all these new ideas I can finally win some games vs you jacek :P
MSmits: still only have a 20-30% winrate with my best versions
jacek: its boring being the 1st
MSmits: in a way it is yeah
jacek: no motivation to improve
MSmits: I would not mind working on yavalath more, but you're right, no motivation
MSmits: I'll help you out, just give me another month or two
MSmits: I got you
jacek: gotta rent that supercomputer eh?
MSmits: maybe as a last resort :P
MaliciouslyCrypticUsername: 25 more days...
jacek: AutomatonNN, who is the biggest noob
AutomatonNN: want to be a teacher for the contest
MaliciouslyCrypticUsername: jacek is the biggest noob
MaliciouslyCrypticUsername: CLashes are getting easy...
AntiSquid: AutomatonNN i see people getting friendly in chat
AutomatonNN: eulerscheZahl is there a way to see a bot to get top 10 or something ?
jacek: MSmits ever heard of SHOT? :O https://hal.archives-ouvertes.fr/hal-01436255/document
DomiKo: Jacek you are using some fancy enhancement in UTTT, right?
jacek: not that fancy, but yeah
DomiKo: maybe one day I'll make something work that well
DomiKo: right now everything is a lot worse or very similiar :(
jacek: how can it be worse?
DomiKo: some enhancement are really slow
DomiKo: and they perform very bad :(
jacek: many of "general" or "knowledge-free" enhancements works mostly only for go, maybe hex/havannah
DomiKo: now I know
DomiKo: why they never use UTTT in papers
jacek: Automaton2000 do you like UTTT
Automaton2000: i think they should be able to help me with my code?
jacek: just a warning, nothing to worry about
DomiKo: Automaton2000 why nobody likes UTTT?
Automaton2000: only for the current one
jacek: reBless loves UTTT
DomiKo: I know how much
DomiKo: that much as clashing
MaliciouslyCrypticUsername: AutomatonNN ping euler
Astrobytes: jacek: Sequential Halving Applied to Trees should have been SHAT. Probably not good in language filters :P
Nerchio: what are you looking for
MSmits: aw damn, nvm :)
AntiSquid: it's past midnight, don't you guys ever sleep?
AntiSquid: seriously, Automaton2000 what do you think?
Automaton2000: maybe not as much as u want
MSmits: think more AutomatonNN
AutomatonNN: MSmits i dont know if it is a lot in the forum
MSmits: err automaton2000
Automaton2000: because i am a bit confused
MSmits: me too now...
MaliciouslyCrypticUsername: AntiSquid it's only 4:53 pm for me
BenjaminUrquhart: what is sleep
BenjaminUrquhart: yes I came here just to say that
BenjaminUrquhart: now I'm gone
MaliciouslyCrypticUsername: Bye then
MaliciouslyCrypticUsername: *Casually eats apples*
MaliciouslyCrypticUsername: Why are you lvl 30 now... I'm still lvl 15 after almost a year
MaliciouslyCrypticUsername: *Makes an improvement to bot* *Rank goes down 600 places*
MaliciouslyCrypticUsername: 900 places now...
MSmits: gj :P
MaliciouslyCrypticUsername: Im trying to move my target point slightly towards the next checkpoint so I turn in the rght direction
BenjaminUrquhart: coders strike back?
BenjaminUrquhart: yes I'm back hi
MadKnight: just subtract 3v MaliciouslyCrypticUsername cmon
MaliciouslyCrypticUsername: All that does is make me turn earlier. I need to turn in the right direction