00:08:00 -!- Phantom_Hoover has quit (Read error: Connection reset by peer).
00:21:12 -!- ais523 has joined.
00:47:15 -!- copumpkin has joined.
01:35:20 -!- moony has quit (Quit: Leaving).
01:35:43 -!- moony has joined.
01:40:47 -!- staffehn has quit (Ping timeout: 250 seconds).
01:42:23 -!- staffehn has joined.
02:06:47 -!- jaboja has quit (Ping timeout: 250 seconds).
02:43:12 -!- ais523 has quit (Quit: quit).
03:39:31 -!- Sgeo has quit (Read error: Connection reset by peer).
03:41:10 -!- Sgeo has joined.
03:52:57 -!- moony has quit (Ping timeout: 240 seconds).
04:26:36 <zzo38> Are there any kind of unusual rules you know of about point calculation of point-based role-playing systems, other than the rules used in GURPS and BESM 3? (My point calculator program supports both of these things, as well as some other custom rules.)
04:45:18 -!- MDead has joined.
04:46:51 -!- MDude has quit (Ping timeout: 240 seconds).
04:46:53 -!- MDead has changed nick to MDude.
05:17:53 <HackEgo> [wiki] [[CASTLE]] M https://esolangs.org/w/index.php?diff=53527&oldid=46390 * Quintopia * (+56) Fix some typos
05:26:15 <HackEgo> [wiki] [[Aubergine]] https://esolangs.org/w/index.php?diff=53528&oldid=53518 * Quintopia * (-2) This is how the Brainfuck page does it
05:38:51 -!- Jojo_ has joined.
05:42:23 -!- sprocklem has joined.
05:51:03 <HackEgo> [wiki] [[List of quines]] https://esolangs.org/w/index.php?diff=53529&oldid=53224 * Quintopia * (+278) Add bauberqueue and purple quine, move the aubergine quine to the cheating section
05:53:46 <HackEgo> [wiki] [[List of quines]] https://esolangs.org/w/index.php?diff=53530&oldid=53529 * Quintopia * (-33) Change aubergine quine to easy to understand golfed version
06:02:01 -!- Jojo_ has left.
06:26:57 -!- sprocklem has quit (Quit: WeeChat 2.0).
06:27:15 -!- sprocklem has joined.
06:30:25 -!- sprocklem has quit (Client Quit).
06:30:44 -!- sprocklem has joined.
06:31:27 -!- sprocklem has quit (Client Quit).
06:31:48 -!- sprocklem has joined.
06:50:11 -!- augur has quit (Remote host closed the connection).
06:51:22 -!- augur has joined.
06:55:27 -!- augur has quit (Ping timeout: 240 seconds).
07:06:30 -!- Lord_of_Life has quit (Ping timeout: 246 seconds).
07:07:17 -!- ATMunn_ has joined.
07:08:58 -!- __20h__ has quit (Ping timeout: 246 seconds).
07:10:21 -!- ATMunn has quit (Ping timeout: 246 seconds).
07:11:17 -!- __20h__ has joined.
07:13:30 -!- fungot has quit (Ping timeout: 260 seconds).
07:14:52 -!- copumpkin has quit (Ping timeout: 240 seconds).
07:17:00 -!- Lord_of_Life has joined.
07:17:57 -!- puckipedia has quit (Ping timeout: 240 seconds).
07:21:28 -!- puckipedia has joined.
07:25:43 -!- heroux has quit (Ping timeout: 250 seconds).
07:31:28 -!- fungot has joined.
08:32:31 -!- sleffy has quit (Ping timeout: 240 seconds).
09:12:51 -!- xkapastel has quit (Quit: Connection closed for inactivity).
09:18:53 -!- copumpkin has joined.
09:28:13 -!- sprocklem has quit (Quit: WeeChat 2.0).
09:28:30 -!- sprocklem has joined.
09:35:02 -!- zseri has joined.
09:36:21 -!- AnotherTest has joined.
09:42:10 -!- zseri has quit (Quit: Leaving).
10:11:15 <b_jonas> zzo38: by point calculatoin, do you mean calculation of XP you gain? or some other points?
10:36:34 -!- zseri has joined.
10:51:54 <HackEgo> [wiki] [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=53531&oldid=53496 * YuvalM * (+143)
10:56:12 <HackEgo> [wiki] [[Brainfuck algorithms]] M https://esolangs.org/w/index.php?diff=53532&oldid=51903 * YuvalM * (+198) /* z = x or y (boolean, logical) */
10:57:00 <HackEgo> [wiki] [[Brainfuck algorithms]] M https://esolangs.org/w/index.php?diff=53533&oldid=53532 * YuvalM * (-1) /* z = x or y (boolean, logical) */
11:13:46 <HackEgo> [wiki] [[Brainfuck algorithms]] https://esolangs.org/w/index.php?diff=53534&oldid=53533 * YuvalM * (+280)
11:15:31 <HackEgo> [wiki] [[Brainfuck algorithms]] M https://esolangs.org/w/index.php?diff=53535&oldid=53534 * YuvalM * (+14)
11:35:42 -!- boily has joined.
11:44:13 -!- mroman has joined.
11:45:39 <mroman> I made a chess variant (http://mroman.ch/b/chess.html). Now I guess I need to program an AI for it.
11:49:11 <mroman> But there are already 57101117117774389051392000000 possible placements in the placement phase.
11:53:33 <mroman> more like 5.139100540599694e28
11:54:54 -!- AnotherTest has quit (Ping timeout: 246 seconds).
12:02:23 <boily> mrelloman! classic AI with tree pruning and heuristics and stuff?
12:04:48 <b_jonas> wtf. so apparently the northern third of Sweden is either not a completely empty wasteland with only elks and reindeers and reindeer hunters living there, or else some supervillain wants us to think that it isn't and get people to travel there so they can capture them
12:05:08 <b_jonas> as in, someone is organizing a conference there: http://knuth80.elfbrink.se/
12:05:37 <b_jonas> seriously, in actual northern Sweden, not just, like, the north part of the southern half of sweden
12:05:56 <b_jonas> there aren't even roads or other infrastructure there, I think
12:06:02 <b_jonas> how would people even go there?
12:09:33 <mroman> boily: that's probably the best to start with, yes.
12:10:01 <mroman> although the easiest thing to start off would be something that makes random moves but always kills if it can.
12:10:12 <mroman> (and a completely random placement :D)
12:11:06 <mroman> although you gotta be careful with that because you can actually loose the game during the placement phase already if your king is in a bad spot after the placement
12:11:13 <mroman> you migth not be able to make a first move
12:12:46 <mroman> Also I'm training an ANN right now to recognize faces in pictures resampled to 12x12
12:14:38 <mroman> http://mroman.ch/12x12.png <- like such
12:15:31 <mroman> works surprisingly well.
12:15:36 <b_jonas> mroman: can it recognize Kappa?
12:16:23 <mroman> right now it has a (sensitivity, specificity) of (~0.8, ~0.8)
12:18:08 <boily> b_jellonas. cucumber kappa?
12:20:32 -!- boily has quit (Quit: HANDBAG CHICKEN).
12:24:01 <b_jonas> mroman: Kappa is one of the more used special emoticon memes on twitch.tv , the video game streaming website
12:25:05 <fizzie> b_jonas: I've driven through (and I think stayed overnight in?) Kiruna, which is significantly more northern Sweden, and can confirm there were roads.
12:27:04 <fizzie> (If you're driving from Finland to Norway and don't take the ferry, the natural route is Kemi-Kiruna-Narvik, mostly on the E10.)
12:27:04 <b_jonas> that's definitely more to the north than I've been to
12:28:09 <fizzie> One of my coworkers just came back from Tromsø, which is probably more northern than I've ever been.
12:28:58 -!- AnotherTest has joined.
12:32:55 <fizzie> It's kind of funny, if you zoom in to the Norway/Sweden border, the Google Maps seems to get significantly more high-res on the Norway side: https://goo.gl/maps/z9ufZEtArXD2
12:33:19 <fizzie> (At least at that particular spot.)
12:35:15 <mroman> I hate it when people do classification stuff and report accuracy.
12:35:22 <b_jonas> fizzie: that usually happens when they have photos made from airplane on one side, but only satellite photos on the other side
12:37:12 <b_jonas> These days they also have crazy 3D reconstructed images of some parts.
12:37:49 <b_jonas> Even 3d images of individual trees.
12:38:44 <mroman> train corporations use scanning of trees and shit to determine which trees are in danger of falling on the rails
12:38:56 <mroman> that's also quite crazy.
12:40:39 <b_jonas> as for trains, what's quite crazy to me is the metro tunnels in Stockholm. have you seen them? they are just dug out with explosives and left like that, with no concrete rings supporting the walls anywhere
12:41:11 <b_jonas> it's quite an amazing contrast to the tunnels here, which have concrete walls everywhere, to isolate the tunnel from the ground around and keep the water and ground out
12:41:50 <b_jonas> of course, Sweden pays for this with the downside that they don't have soil for agriculture, which is quite a high price to pay for those few railway tunnels
12:43:44 <b_jonas> also, bridges. they have a ton of water channels with medium length bridges over it. and sometimes there's two parallel bridges over water, one above the other, the railway on the bottom bridge and road on the top bridge.
12:43:52 <b_jonas> that's impossible here, because the terrain is just too flat
12:44:07 <b_jonas> but there, they have steep shores within the city and small canals
12:44:18 -!- LKoen has joined.
12:52:36 <mroman> People should use sensitivity, specificity and confidence to rate their classification performance even if you have more than two classes.
13:28:30 <HackEgo> [wiki] [[Special:Log/newusers]] create * Ave * New user account
13:29:55 <fizzie> b_jonas: One of my coworkers moved to the US to start a startup on aerial/satellite photo analysis, https://tensorflight.io/
13:31:54 <HackEgo> [wiki] [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=53536&oldid=53531 * Ave * (+241)
13:31:55 <fizzie> Looks like they've since pivoted to be about property inspections for insurance-related matters. It was something more generic last I looked.
14:14:40 <mroman> fizzie: at least it has a useless animation that lags browsers and wastes energy on their website :D
14:29:27 -!- ATMunn_ has changed nick to ATMunn.
14:33:06 -!- LKoen has quit (Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.”).
14:37:57 -!- Lord_of_Life has quit (Changing host).
14:37:57 -!- Lord_of_Life has joined.
14:37:57 -!- Lord_of_Life has quit (Changing host).
14:37:57 -!- Lord_of_Life has joined.
14:41:27 <fizzie> mroman: Yeah, that's new too. :)
14:51:02 <mroman> http://mroman.ch/mandel.html
14:51:07 <mroman> if u like laggy webpages
14:52:27 <mroman> the newest firefox really sucks at rendering it.
14:52:31 <mroman> the older versions were much faster
14:53:56 <Taneb> I suspect that browser designers weren't optimizing to that particular use case
15:04:07 <mroman> but now I get complaint from customers being unable to use my main business e-commerce e-shop e-website due to the new firefox.
15:05:05 -!- AnotherTest has quit (Ping timeout: 248 seconds).
15:05:41 <Taneb> That sounds e-awful
15:05:46 <Taneb> I'm so e-sorry for you
15:06:09 <mroman> well... I gotta math-jaxify my pseudo-paper now.
15:11:01 <mroman> can pandoc convert to mathjax?
15:11:44 <Taneb> I think so? Not sure though
15:13:25 <mroman> hopefully fixable with some CSS.
15:16:21 <mroman> http://mroman.ch/guides/sensspec.html
15:19:34 <HackEgo> [wiki] [[Alice]] N https://esolangs.org/w/index.php?oldid=53537 * Martin Ender * (+712) Create page... one day I might convert the language spec from Markdown to MediaWiki if I can be bothered...
15:21:27 <HackEgo> [wiki] [[User:Martin Ender]] https://esolangs.org/w/index.php?diff=53538&oldid=47181 * Martin Ender * (+158)
15:23:52 <mroman> ah. lil borders around the tables and it looks much better.
15:25:46 <HackEgo> [wiki] [[Alice]] https://esolangs.org/w/index.php?diff=53539&oldid=53537 * Martin Ender * (-78) whoops
15:27:08 <mroman> If you like sums, this is for you :D
15:27:33 <HackEgo> [wiki] [[Retina]] https://esolangs.org/w/index.php?diff=53540&oldid=46718 * Martin Ender * (+102) catching up with my name change
15:28:01 -!- AnotherTest has joined.
15:28:09 <mroman> I wrote that as a stackoverflow answer.
15:28:40 <HackEgo> [wiki] [[Retina]] M https://esolangs.org/w/index.php?diff=53541&oldid=53540 * Martin Ender * (-1) /* External resources */
15:28:50 <HackEgo> [wiki] [[Alice]] M https://esolangs.org/w/index.php?diff=53542&oldid=53539 * Martin Ender * (-1) /* External Resources */
15:29:12 <HackEgo> [wiki] [[Labyrinth]] https://esolangs.org/w/index.php?diff=53543&oldid=44839 * Martin Ender * (+63) catching up with my name change
15:29:31 <mroman> probably a lot of spelling errors in there still
15:32:05 <Taneb> "this aren't all true negatives" I think should be "these aren't all the true negatives"
15:32:39 <mroman> which section is that?
15:32:56 <Taneb> N-Ary Classification?
15:33:09 <Taneb> In Sensitivity and Specifiticity
15:33:30 <HackEgo> [wiki] [[Hexagony]] https://esolangs.org/w/index.php?diff=53544&oldid=47245 * Martin Ender * (+66) catching up with my name change
15:33:38 <mroman> "all the true negatives"
15:34:19 <HackEgo> [wiki] [[Brian & Chuck]] https://esolangs.org/w/index.php?diff=53545&oldid=46558 * Martin Ender * (+69) catching up with my name change
15:34:58 <Taneb> What is your first language, ooi?
15:35:09 <HackEgo> [wiki] [[Stack Cats]] https://esolangs.org/w/index.php?diff=53546&oldid=47183 * Martin Ender * (+70) catching up with my name change
15:35:34 <HackEgo> [wiki] [[Retina]] M https://esolangs.org/w/index.php?diff=53547&oldid=53541 * Martin Ender * (+0) /* External resources */
15:35:34 <mroman> The language of the norths.
15:35:38 <mroman> although it's south from you probably
15:35:46 <HackEgo> [wiki] [[Labyrinth]] https://esolangs.org/w/index.php?diff=53548&oldid=53543 * Martin Ender * (+0) /* External resources */
15:36:13 <HackEgo> [wiki] [[Alice]] M https://esolangs.org/w/index.php?diff=53549&oldid=53542 * Martin Ender * (+0) /* External Resources */
15:36:21 <Taneb> I'm currently living in what I think is "south" and it's still further north than most of Germany
15:36:32 <Taneb> Although not as much Germany as I thought
15:37:09 <Taneb> Roughly the same latitude as Brunswick?
15:37:16 <HackEgo> [wiki] [[Language list]] https://esolangs.org/w/index.php?diff=53550&oldid=53504 * Martin Ender * (+12) /* A */ add Alice
15:38:47 <Taneb> British, I'm from the old esoteric homeland of Hexham and currently in Cambridge
15:40:36 <HackEgo> [wiki] [[List of quines]] https://esolangs.org/w/index.php?diff=53551&oldid=53530 * Martin Ender * (+314) /* Real Quines */ add Alice
15:49:15 <mroman> *reinterpret_cast<private_member_type*>(reinterpret_cast<char*>(&my_c.public_member) + sizeof(my_c.public_member)) = 0xDEFACED
15:50:42 <zseri> but delphi is worse
16:07:59 -!- mroman has quit (Ping timeout: 260 seconds).
16:35:00 -!- hkgit03 has joined.
16:56:30 -!- LKoen has joined.
16:56:35 -!- hkgit03 has quit (Quit: Leaving).
17:11:09 -!- Remavas has joined.
17:22:34 <zzo38> b_jonas: I mean calculations of point totals of all of the traits based on any modifiers and so on you add on to them, how to calculate them based on that
18:14:11 -!- Remavas has quit (Quit: Leaving).
18:21:34 <lambdabot> LOWI 081750Z 27004KT 8000 -RASN SCT007 SCT020 BKN060 01/00 Q1011 R08/29//95 NOSIG
18:36:07 -!- augur has joined.
18:41:21 -!- sleffy has joined.
18:53:41 -!- heroux has joined.
19:02:01 -!- heroux has quit (Ping timeout: 260 seconds).
19:08:12 -!- heroux has joined.
19:09:11 -!- zzo38 has quit (Ping timeout: 240 seconds).
19:24:24 -!- oerjan has joined.
19:25:56 -!- sleffy has quit (Ping timeout: 260 seconds).
19:45:10 -!- ChanServ has set channel mode: +o oerjan.
19:45:34 -!- zseri has quit (Quit: Leaving).
19:46:03 <oerjan> (bit silly, but suggested in a global notice)
19:55:22 -!- xkapastel has joined.
20:01:24 <oerjan> test: [wiki] [[Alice]] N
20:10:17 -!- jaboja has joined.
20:12:16 <oerjan> test: <HackEgo> [wiki] [[Labyrinth]]
20:12:51 <oerjan> test: <HackEgo> [wiki] [[Hexagony]]
20:13:45 <oerjan> for some reason those show up different in the logs...
20:29:22 <int-e> grrrr, is there a replacement for "Open in Browser" that works with FF 57
20:29:59 <int-e> oh stupid question
20:31:05 <oerjan> i think it's an IE problem caused by some strange characters mroman used in a particular line
20:31:45 <int-e> the right question is, why does the plugin currently not work for the #esoteric logs
20:32:24 <oerjan> when i edit that away, the file shows fine. but with it, the _previous_ N-something lines get HackEgo's wiki announcements to show weirdly (but before that again they're as they use to.)
20:33:16 <oerjan> mind you, the weird thing is that IE _shows_ ^C's as boxes instead of leaving them out entirely, and also has problems selecting the line.
20:33:49 -!- oerjan has set channel mode: -o oerjan.
20:39:08 <int-e> well, links shows dots
20:40:00 <int-e> Anyway, really unhappy with how many things Firefox 57 broke.
20:48:44 <oerjan> . o O ( has anyone forked 56 yet )
20:49:56 -!- augur has quit (Remote host closed the connection).
20:50:43 <shachaf> I learned about an interesting conjecture yesterday.
20:52:03 <shachaf> If you write a greedy algorithm for the "infinite queens" problem, i.e. you start in the corner of an infinite chessboard, and for each subsequent row you put a queen in the leftmost row where it doesn't threaten any other queen, the queens form approximately two lines from the corner.
20:52:17 <shachaf> The slopes of those lines seem to be approximately phi and 1/phi
20:53:16 <garit> There is exact solution with the same pattern without phi being involved
20:54:04 <garit> Using horse steps of a previous queen
20:54:38 <shachaf> I'm specifically describing the greedy algorithm.
20:54:45 <shachaf> Or what do you mean by horse steps?
20:56:06 <garit> Right-down-down-down from a previous queen, this cell is always free (assuming no prepositioned queens), and when we reach the bottom we repeat the same process on a second half of a board
20:57:23 <garit> Pattern is slightly different for even and odd boards. And infinity isn't even or odd
20:57:58 <shachaf> I'm talking about an infinite board.
20:58:33 <garit> Then just start to build second line one infinity to the right :P
20:59:01 -!- jaboja has quit (Ping timeout: 240 seconds).
20:59:12 <Taneb> The pattern for the greedy algorithm goes 1,3,5,2,4,6,8,10,7, right?
21:00:12 <shachaf> I think your 6 threatens your 1
21:00:34 <shachaf> It goes http://oeis.org/A065188
21:01:49 <Taneb> Forgot about diagonals
21:29:01 -!- jaboja has joined.
21:38:40 -!- augur has joined.
21:42:57 -!- augur has quit (Ping timeout: 248 seconds).
21:45:23 -!- moony has joined.
21:46:41 -!- augur has joined.
21:49:30 <oerjan> shachaf: you said rows, that link says antidiagonals
21:56:04 <shachaf> But I think you end up with the same pattern maybe?
21:56:56 <shachaf> Though maybe not. Or maybe it's not known, because when I heard this problem it wasn't even proven whether it was a permutation.
22:06:00 <oerjan> hm the grid shown under "example" _does_ look consistent with doing it column by column
22:11:25 <fizzie> Opinion poll: should I, or should I not, copy the https://esolangs.org/forum/ archive over to the new place?
22:11:36 <fizzie> It's mostly DVD sales spam, but there's a few actual conversations.
22:12:31 <fizzie> Probably not, but it's the LOWEST PRICE.
22:13:18 <shachaf> Do they have Real Fast Nora's Hair Salon 3: Shear Disaster Download on DVD?
22:15:11 <quintopia> it says download right in the name.
22:15:27 <int-e> Wait, you don't download DVDs?
22:15:40 <quintopia> what does the last d stand for int-e?
22:15:49 <int-e> Information technology is so limited.
22:16:13 <quintopia> we're still waiting on diamond age
22:16:24 <int-e> quintopia: digital versatile downloadable?
22:16:58 <quintopia> exactly! nothing about downloading anywhere!
22:17:04 <int-e> (DVD *is* one of the funnier acronyms... based on the "V")
22:17:22 <int-e> Almost as funnny as PCMCIA.
22:18:00 <oerjan> shachaf: ok, i convinced myself it's equivalent whether you do it by antidiagonals or by columns
22:18:15 <quintopia> anyway, i vote for copying over the forum in read-only format. and if it's possible to remove the spam, that too
22:18:29 <oerjan> in particular there is one in each column
22:18:39 <int-e> (Of course it's hard to beat intel's IE ("innovation engine") (because why stop at *one* super privileged hardly accessible processor in the processor (the ME), when you can have two?))
22:19:35 <int-e> now to figure out what the other discussion is about...
22:19:52 <oerjan> . o O ( PCMCIA, it's fun to be ... )
22:23:22 <oerjan> proving that there's one in each row seems a bit trickier
22:25:37 <oerjan> which means it might not be a permutation, if it's not bijective.
22:26:54 <int-e> > let go y l d r = let x = head [x | x <- [1..], not ((x+y) `S.member` l), not (x `S.member` d), not ((x-y) `S.member` r)] in x : go (y+1) (S.insert (x+y) l) (S.insert x d) (S.insert (x-y) r) in go 1 S.empty S.empty S.empty
22:26:56 <lambdabot> [1,3,5,2,4,9,11,13,15,6,8,19,7,22,10,25,27,29,31,12,14,35,37,39,41,16,18,45,...
22:30:46 <int-e> Hmm, funny. I use infix for S.member, but not S.insert...
22:36:35 -!- AnotherTest has quit (Ping timeout: 250 seconds).
22:39:26 -!- oerjan has quit (Quit: Nite).
22:45:31 -!- heroux has quit (Ping timeout: 240 seconds).
22:46:39 -!- heroux has joined.
22:49:57 -!- zzo38 has joined.
22:59:35 -!- ais523 has joined.
23:02:01 -!- sleffy has joined.
23:29:48 <int-e> shachaf: at least this lends itself to drawing pictures like this: http://int-e.eu/~bf3/tmp/queens.png
23:30:34 <quintopia> what exactly is the greedy algorithm in question?
23:30:59 <quintopia> is it "for each row from the bottom place a queen in the leftmost unattacked position"?
23:31:31 <int-e> Well, I did it from the top, but yes.
23:32:04 <quintopia> and you got approximate lines of slope phi?
23:32:29 <int-e> Yes, but I do not understand why.
23:33:31 <quintopia> well, i mean, if someone were to say to me "hey can you believe the queens were close to a line? what do you think the slope of that line was?" my guess would be phi. It's the obvious choice for such a problem.
23:40:49 <int-e> It becomes more convincing when the 10001st queen is at slope 0.6181381861813818 and the 10002nd at slope 1.6179764047190561.
23:49:41 <quintopia> it's more convincing that it is intuitively true to me, but i am having a hard time formalizing my intuition. It has to do with the fact that a queen placed at (x,y) attacks all squares whose coordinates sum to x+y. And so, to go back to the left, you have to find an unused sum. What is the sequence of sums? 0,3,6,4,7,13,19,...
23:50:24 <quintopia> obviously it also has to do with the fact that phi and 1/phi are the most irrational positive numbers
23:51:13 <ais523> with a question like this, I think you'd need more evidence for it to /not/ be phi than for it to be phi :-P
23:51:48 <int-e> quintopia: the trouble with that line of reasoning is that many sums are unused.
23:59:49 <ais523> what proportion of the queens are placed to the right of all previous queens?
23:59:55 <ais523> that's likely to be a relevant part in the proof