« first day (2574 days earlier)      last day (2259 days later) » 
00:00 - 13:0014:00 - 00:00

12:02 AM
0
A: Sandbox for Proposed Challenges

caird coinheringaahingChain up the cops! Thanks to Magic Octopus Urn for the original idea! This is a combination between a answer-chaining and a cops-and-robbers challenge. Cops Your task is to create a program that, when run in language A outputs a program, that when run in language B outputs a program which run...

 
12:34 AM

 Phigs

For discussion of this in-development golfing language.
 
Wait, waht does o do?
 
Output
 
It's supposed to be a golfing language and you don't have implicit IO? Don't go down the same road as MY
Especially since you know how to parse
 
"it lives" not "it golfs"
 
Proton takes a really long time to parse long strings for whatever reason...
 
12:42 AM
where are your qualifier functions defined?
 
what is that o_O
 
Phigs> 6 8 *
48
Phigs> [6 7] 1 +
[7 8]
@Zacharý It does
 
"OR", "ZERO_OR_MORE", "ANY_EXCEPT"
 
@ConorO'Brien I might want to use modgrammar eventually.
 
I mean honestly that type of parsing is only useful for complex scenarios, and then you could probably write a parser compiler to make it faster
(or just write your own parser :P)
 
12:46 AM
@ConorO'Brien ._.
 
last time I tried it was horrible
they are defined by modgrammar
 
so I spoke without knowing what modgrammar, so that code was generated by modgrammar?
 
@HyperNeutrino How long?
 
like, 3 seconds for a length 16 or so string
 
How does it scale, linearly?
 
12:49 AM
@ConorO'Brien Yeah, OR, ZERO_OR_MORE, and ANY_EXCEPT are defined by modgrammar.
 
it's probably backtracking
 
@H.PWiz seemingly exponentially
 
oh God
 
@HyperNeutrino how long does it take when you do a plain ANY_EXCEPT("\"") instead of the alternation?
 
becomes instant for like length 50
basically instant
 
12:51 AM
what exactly is OR doing? o_O
I think my suspicion was right, it seems to be doing some backtracking
that would explain the exponential runtime at least
 
hm ok. The OR just allows for backslash escapes, and the larger OR is for 'single' and "double" quoted strings
 
1:07 AM
@Mr.Xcoder CMC: compress this list of palindromic primes.
 
For[i = 1, True, i++, Echo@{"", Prime@i}[[1 + Boole@PalindromeQ@Prime@i]]]
Hmm, the supplied Mathematica implementation at OEIS seems to be overcomplicated
It even implements PalindromeQ from scratch
 
0/10, not golfed
 
@Pavel which language is that?
 
@ConorO'Brien Mathematica
 
1:16 AM
@Zacharý Mathematica inserts spaces automatically when you copy from there
 
o.O
 
Palindromic\Primes[2083] in Attache. Mathematica++ :P
 
@ConorO'Brien What's 2083 doing?
 
first 2083 primes
18181 is the 2083rd prime
 
Prime@Range@2083~Select~PalindromeQ, because for some reason you can't index into Primes, only check for membership.
 
1:19 AM
it works fine when I take the string grammar out and test it on its own which suggests to me that a higher level grammar is backtracking
 
@HyperNeutrino can you replicate the exponential time behavior for something other than strings?
@Pavel is ~ sort of like a pipeline?
 
I can't seem to...
 
@ConorO'Brien Infix. You can also do Select[Prime@Range@2083,PalindromeQ]
 
And get `{2, 3, 5, 7, 11, 101, 131, 151, 181, 191, 313, 353, 373, 383, 727, \
757, 787, 797, 919, 929, 10301, 10501, 10601, 11311, 11411, 12421, \
12721, 12821, 13331, 13831, 13931, 14341, 14741, 15451, 15551, 16061, \
16361, 16561, 16661, 17471, 17971, 18181}`
(Forgot Mathematica inserts lineberaks for you too)
 
1:23 AM
so @ is function composition, does it treat 2083 as a zero-arg function?
 
No, @ is function application
Expands to Prime[Range[2083]]
 
oh, so @ is a bit like a pipeline then
 
a reverse pipe
 
@totallyhuman F# calls it a backpipe, but really, it's the apply operator.
 
same thing :P
 
1:25 AM
are F#'s backpipes also right-associative?
 
Right. That's their entire purpose.
 
that makes sense
 
Apply is left-associative though
 
wait so is a ~ b ~ c ~ d ~ e meant to be d(b(a, c), e) or b(a, d(c, e))
 
that's up to you to figure out :P
 
1:27 AM
d[b[a, c], e]
@HyperNeutrino Mathematica says ^
 
@Pavel wait how? if it was wouldn't Prime@Range@2083 be (Prime@Range)@2083 = Prime[Range][2083]?
 
@ConorO'Brien I misspoke. It's right associative, it just has really high precedence.
 
oh ok cool
 
As apposed to the backpipe which has the lowest precedence
Oh no. @ isn't called the Apply operator. It's the Prefix operator. The Apply operators are @@ and @@@.
 
ohh I thought @@ was function composition instead of @*, haha
 
1:30 AM
I call @ the apply operator, @@ the splatting apply operator, and @@@ the doubly splatting apply operator.
 
apply, doubly apply, triply apply?
lines up with the amount of @s
 
ok good
 
@Pavel the closest equivalent in attache would be Select[Palindromic,Prime!1&Range!2083], it's about the same, except Prime is 1-indexed
 
@HyperNeutrino I see one bug, the ANY_EXCEPTs should really exclude `\\` as well.
 
a `\ `b
 
1:44 AM
Why does the chat have a different markdown flavor. :(
testing
 
because chat is weird
 
Feb 1 at 21:18, by caird coinheringaahing
I'm coining it. The TNB link effect: Someone links to a room, and at least 5 people more than intended go into the room at once.
 
How many times has that been brought up, Ð?
 
no idea, I don't follow this room 24/7 anymore
 
@ETHproductions yup XD
 
1:51 AM
@ETHproductions yup
 
@ConorO'Brien Mathematica's Prime is also one indexed
As is its Range
 
ah, Attache's range is 0 indexed
 
Mathematica is 1-indexed, although oddly enough you can index into any object to get it's type at index 0.
 
@ØrjanJohansen i feel like that's why it's so slow o_O i'll see if fixing that makes it faster
 
Well if the parsing framework is slightly smart it should only matter if the string contains lots of \ s, and if it isn't you would get backtracking anyway. I think.
 
2:00 AM
Having the option for either one is best.
 
But it's still a bug, because it can cause the string to end in the wrong place.
If the first alternative is tried first, then "\"" would do so.
 
ok I fixed that though it still doesn't make it any faster. oddly enough, just the string code on its own is fine: TIO
 
What happens if you disable the string code?
 
2:17 AM
Stuff breaks
Avacado strikes again instagram.com/p/Bb91CvfFcIQ
caps lock :P
 
@HyperNeutrino What happens if you switch IndexAccess and Value in FunctionAtCall?
(That's not a fix, just a test)
 
@Christopher That's actually terrible. Why would you expose more people to that.
 
@Pavel Because this is avacado land
 
@HyperNeutrino I think the reason why the string code alone works is that it then just takes the first parse that works, which is usually fast (especially after fixing the first bug I found)
 
@ØrjanJohansen (before I do it) my prediction is that it will just cause index accesses to not work because IndexAccess is a subset of Value (after I do it) wtf that worked
> not a fix just a test
well you somehow managed to fix it o_O
thanks :D
 
2:31 AM
But as soon as you have something that can fail afterwards, it's exponential to backtrack out of the string.
 
hm ok
 
@HyperNeutrino I think now index accesses with strings will blow up.
 
What is going on
 
@Christopher we're trying to optimize HN's language because it takes a long time to parse strings
 
actually, no it doesn't. (I mean, it fails, but that's because I didn't fix the behavior of index accessing in the interpreter part yet, and so the failure is as expected)
 
2:33 AM
@ConorO'Brien kool
 
Well if it ends up exponential after the fix you can refactor that as (Value, OPTIONAL ( ...index stuff...)).
 
it seems to run instantly now by swapping the order, though I discovered a new issue when testing but that's another thing
but the strings taking a long time thing seems to be fixed, thanks!
 
As long as the rest of the grammar never requires backtracking once you've started parsing a string, it should work. But I wouldn't guarantee that.
And you're going to take exponential time again if you ever have an actual parse error after the string literal.
Parser combinators really need a way to commit to a choice to prevent this sort of stuff.
 
Oh I get it, IndexAccess fails because there's no [ so it backtracks the entire thing. Hm :/
 
Why don't u just use regex
 
2:41 AM
One of Proton 2.0's goals was "avoid using regex for the parser"
 
because regex also does backtracking/isn't good/smart enough
 
I haven't even imported the re module for Proton :D
also regex is no smarter than modgrammar and modgrammar is way nicer to use and also faster
 
It was joketh
 
regex is no laughing matter. it's a matter of life and death. (hides regex-based parsers)
 
2:43 AM
JokETHPRODUCTIONS?
 
I mean modgrammar is in some ways extremely similar to regex. almost every parser i've seen (for languages that have a concept of a parse tree, so not including things like 05ab1e) is regex-based
Positron's parser is nowhere near resemblance to regex though :P
it's somehow worse
 
Are you keeping Positron and Proton?
 
well I'm not taking them down from GH but I'm not working on them any more
especially not positron
its parser is so broken that it's almost funny
 
So Proton/Proton2 is à la Perl/Perl6?
 
the advantage to it is that it doesn't require lookahead. You can feed it tokens one at a time
@Zacharý sure I guess
 
2:50 AM
Je juste aime les mots "à la" :p
 
oo parlons-nous francais?
 
Oui, un peu
 
Je pense qu'on ne peut pas utiliser <<juste>> comme ca, mais jnsp
 
@Zacharý ç'est ton langage naturel ou tu l'appris en école ?
 
<<un peu>>. L'anglais est mon langue naturel.
 
2:53 AM
@HyperNeutrino oui, on échange l'ordre de les deux mots <<aime>> et <<juste>>
 
ouaip, je l'oublie juste.
 
mais ne dirais-il pas <<I love just the words...>> comme il dit qu'il n'aime pas les autres mots?
 
3:08 AM
CMP: For Proton 2.0, I'm adding a value!! expression much like in Kotlin where it errors if value is null (in this case, None). How tightly should it bind? I'm thinking maybe more loosely than a#b but more tightly than a**b.
 
what's a#b?
 
a#b#c... == a[b][c]...
 
@HyperNeutrino that sounds about right
 
@HyperNeutrino I am strangely attracted to this feature
 
@ETHproductions it's similar to a feature in J, c{b{a is equivalent. I do like infix element accessing, it seems very convenient
 
3:21 AM
BLECH, J
 
@Dennis wouldn't the answer in HTML still be invalid? HTML is not a programming language and cannot be used on its own right?
 
@Zacharý blech, unicode characters e_e
 
Fortress does it best. You can use Unicode and/or ASCII
 
tfw you get most of the way through writing an explanation and then realize you could save 2 bytes by completely rearranging your answer...
 
@Zacharý it's one or the other! xor supreme!
 
3:23 AM
@ConorO'Brien ... y u no use !=
 
@Christopher You don't need to use a programming language in Kolmogorov complexity challenges...
 
@Dennis woops
I still downvoted it because it kinda sucks as an answer, no effort
 
@Dennis I thought that if the "language" satisfies the challenge and has an interpreter, it's valid, right?
 
For KC, yes. I don't think there's a clear consensus right now for everything else.
 
3:28 AM
The reason I have infix function call and array access is so I can do things like map(array&(#),indices) :D
 
@HyperNeutrino or you could make array access vectorize so you could do array#indices
 
@ConorO'Brien a[x, y] == a[x][y] based on user requests.
 
e_e
wait that still doesn't define a[[x,y]]
 
hm true
 
do what JS does and just return a[str([x,y])]
:P
 
3:35 AM
uh wtf
please
i want people to actually want to use my language
:P
 
maybe throw an error? idk why you'd want to be using an array as a property id
 
i was thinking to vectorize it
proton 1.0 does that with a[x, y] but users (i.e. Pavel) want it as a[x][y] so I'm going to do that because it also makes sense :p
CMP: a[(x, y)] == a[x, y] == a[x][y] or a[(x, y)] == (a[x], a[y])?
 
#2
same goes for a[[x,y]] I guess
 
e.g.: inds = a.indices(e -> e is even); a[inds] would be an array of even numbers
   0 2 3 { 1 2 3 4 5
1 3 4
 
3:40 AM
As a C programmer, I'd expect a[(x, y)] == (x, y)[a]. :P
 
@Dennis ah yes, the classic address identity lol
 
how does
wat ._.
 
3:46 AM
THat feeling when you write more French in PPCG than you do in French class
 
@Zacharý right??
 
last year i'd have to spend like a minute translating each sentence and now i can just read it and understand most of it on the first run (minus some words not in my vocabulary that i have to infer)
it's great :D
 
Our teacher tries to make it so we don't have to go through and translate it. I think that's how I would describe it
 
yeah basically. my grade 9 french teacher spoke too much english in class and was in some sense too nice to the people falling behind? idk it's hard to explain, she was a good teacher though. this year the teacher spoke almost entirely french and at first she used really simple vocabulary and then gradually just sped up and used harder words and nobody even really thought much about it until she was like
"look at you guys, it's only been six weeks and i can just speak to you in french and you all understand it"
brb
 
@HyperNeutrino Was that in french?
 
4:02 AM
@Zacharý yeah. iirc, the way you know you really know a language is when you think in it instead of having to translate
 
Do you have the same French class?
I was asking if she said that in French
 
I took Spanish in middle and high school
 
Normy
 
¡Cállate!
:P
tbh, French always looked like a p.i.t.a. when it was written out. WHERE THE FUCK ARE ALL THESE EXTRA LETTERS COMING FROM
 
@Zacharý no, that was one of the few things she said in english. she only says stuff when it's of particular importance and it's important that everyone understands it the way she intends
 
4:05 AM
I almost responded in French ._.
 
pat pat
 
@mudkip201 What are you talking about? "elles créées" is a perfect way to represent "they created"
 
...
@ConorO'Brien I meant the silent letters at the end of words
 
@Zacharý mdr (:P)
 
@mudkip201 "ils haïssent" :)
 
4:07 AM
@ConorO'Brien but 'ai', 'aie', 'aient', 'aies', 'ait', 'es', 'est', and 'et' are all pronounced the same
 
@ConorO'Brien wouldn't it be elles a creees
 
@ConorO'Brien I dun speak French
 
@mudkip201 homophones aren't unique to french :P
 
well, duh
 
@mudkip201 Could be worse: ENGLISH
 
4:08 AM
@mudkip201 actually ai and et are pronounced the same and the rest are pronounced the same as each other but different from the aforementioned
 
French's rules are somwhat regular, at least
 
@Zacharý eh, I blame the French for that
 
at least french has consistent rules. in english there are approximately 0 rules that always hold
 
@HyperNeutrino well yeah I forgot the participle but that's the gist
 
other than "a word always has letters in it"
o ok yeah
 
4:09 AM
I don't know French, but my rule of thumb when it comes to pronouncing French words is to just drop all trailing consonants :P
 
participle or auxiliary? my teacher always calls it the latter
 
How often does this actually work?
 
@mudkip201 ITZ TEH VAWEHL SHEEFT
@HyperNeutrino Either or.
 
@ETHproductions almost all of the time actually, but it doesn't cover everything
 
4:10 AM
You have to be CAREFUL... mdr
 
@HyperNeutrino auxilary is the "helping verb", participle is about the same sometimes
 
hm okay i see
 
How useful is unary negation when you've already got bitwise negation, and subtraction / addition, etc?
 
In a golfing lang? Very useful
 
Well, you could have special cases for non-booleans, so possibly VERY useful
Ninja'd
 
4:15 AM
much better than having to do 0- or similar every time
 
That was the most French I've written in FOREVER
 
Je ne comprehend very much French pas.
 
Chiac-esque, mdr
 
Even though I do actually need to sit down and study it sometime.
 
4:29 AM
Yeah. I would've taken German if our school offered it. But we're in the middle of nowhere.
 
1
Q: Tips for golfing Yabasic

Taylor ScottYabasic, or Yet Another Basic is a dialect of BASIC created by Marc-Oliver Ihm that may be run on Windows, Unix and PAL versions of the Sony PlayStation 2. Development for this language is ongoing. Some Yabasic Official Website Yabasic Manual Yabasic Wikipedia Page Yabas...

 
4:50 AM
Can anyone try viewing the TPLQ snippet? My browser crashed twice...
 
If I award this bounty, will it stay featured for the full 7 days?
 
Anonymous
@tfbninja No. Challenges are only featured while the bounty is posted but not awarded
 
@Mego dang
thanks
 
@tfbninja Thanks for the bounty, by the way. I'm still surprised that solution ended up safe...
 
Yeah I'm surprised anyone got a safe answer
 
4:53 AM
0
Q: Tips for golfing Yeep

TheOnlyJacobOnStackYeep was originally developed back in 2015 by a Swedish programmer. Yeep was used once by an APL programmer, and then never again by that same programmer. Yeep can be compiled to any language, although the commonly accepted standard is to assembly (then to binary). Its only been successfully r...

 
builtin for e^<something>, useful?
 
Anonymous
@Οurous Very
 
Noted
 
Wait, was one safe?!
 
Its utility is exponential.
 
5:02 AM
People can definitely do better than ~300 bytes. MY MY cop lasted ~1 day, and I made the language
 
5:44 AM
Are reverses of every comparison operator useful? Or does that waste space
 
5:55 AM
@Οurous Not an answer to the question, but what language are you designing?
 
What's the font of the text at the bottom of the original JHT ad? It's kerning looks so good if that wasn't made just for the ad.
 
@EsolangingFruit Two-Dimensional, Lazily-Evaluated, Brainfuck-Inspired-But-Not-Related, Loop-Interleaving, Stack-Based general purpose language.
 
TDLEBIBNRLISBGPL?
 
Implemented in Clean, so I'm calling it Dirty
But I like that. Dirty: a TDLEBIBNRLISBGP language.
 
Make it compile to Clean and call the compiler Janitor.
4
 
6:05 AM
@EsolangingFruit I'll put that on the todo list.
 
The charset has a lot of boxes for me :(
 
Huh. The current charset (cs_mapping) doesn't have any boxed for me in Chrome.
I've been trying to replace ones that aren't widely supported with good equivalents, can you paste which ones are boxes so I can have a look?
Oh, yeah, forgot to @EsolangingFruit ^
 
6:21 AM
@Οurous ⏻⏵⏴⏶⏷⭪⭫⭬⭭⭮⭯⮕⭤⭥⭢⭡⭣⭠⭦⭧⭨⭩⭰⭱⭲⭶⭷⭸⭹⮒⮓
That looks like nonsense to me :P
 
@EsolangingFruit should be that ^
 
0
Q: How to get funny t shirt?

user78254From few days I'm looking for some customized shirt for me and my friend's circle. We are planning to go for fishing in a reputed lake there will heald a fishing competition. So we need some quality full shirt that meet our required. One of my friends suggested me this eamazongo.com particular si...

 
This is a Good Comment™:
 
It is indeed a good comment.
@EsolangingFruit Sadly, other than the triangles and the rotation circles, most of them don't have applicable unicode replacements
 
Clearly, the character set should be encoded not with Unicode, but with TeX.
That way all the fancy symbols can render the same for everyone.
Only downside is that it's a horrible idea.
 
6:33 AM
@EsolangingFruit ... Hmmmmmm. I'll put that on the todo list as well. In addition to a native byte mode, and a UTF8 mode, a TeX mode.
 
Don't actually use TeX, though, unless you want some idiot (read:me) hanging your parser
Just borrow the sequence names.
 
@EsolangingFruit Ooh. I can do the same with HTML entities too. That's only 3 translation front-ends, so it isn't too much work either.
 
@Οurous If I were to design a golflang, I'd drop the Unicode entirely. Allow mix-and-matching TeX, HTML, and printable ASCII where possible
 
@EsolangingFruit TBH, I may end up with that. It was just the easiest way to get a compendium of different symbols to pick from. Now that I kinda know what the commands look like, (still might drop some of the mirrored comparisons), any symbol set that can represent them works.
 
6:54 AM
@Οurous thx
@EsolangingFruit thx
 
0
Q: Tips for golfing in Visual Basic

Taylor Scott This page is not for Visual Basic .NET Tips Visual Basic (VB) is an object-oriented and event-driven dialect of basic that was developed and released by Microsoft in 1991. The last release of Visual Basic came as Visual Basic 6.0 in 1998, and the language was declared a legacy language in 2008...

0
Q: Tips for golfing in Visual Basic .NET

Taylor ScottThis page is not for Visual Basic Tips Visual Basic .NET (VB.NET) is an multi-paradigm dialect of basic that was developed and released by Microsoft in 2002 as a replacement for Visual Basic. The current version of VB.Net as of Feb 2018 is Visual Basic .NET 15.0. Unlike Visual Basic (VB), Vi...

 
0
A: Sandbox for Proposed Challenges

jpmc26Do I Have Honors? code-golf card-games In contract bridge, once a contract is reached and the demonination is determined (one of the standard card suits or No Trump), a player is awarded bonus points if they have several guaranteed winning cards in their hand. This bonus is called honors. A p...

 
7:21 AM
Are the Fedora repos down for anyone else? dnf update isn't working for me and I'm hoping it's not something wrong on my end.
 
 
2 hours later…
9:22 AM
0
Q: Local periods of strings

ZgarbLocal periods Take a non-empty string s. The local period of s at index i is the smallest positive integer n such that for each 0 ≤ k < n, we have s[i+k] = s[i-n+k] whenever both sides are defined. Alternatively, it is the minimal length of a nonempty string w such that if the concatenation w w ...

 
So I'm trying to solve the following problem: Given a n*n matrix A of 0 and 1, find a vector x of length n of non-negative numbers, having sum 1, such that 'min(A x)' is maximized. Is there any simpler/more efficiient way to solve this than using the simplex algorithm?
 
9:40 AM
0
Q: Biggest number challenge (Brainfuck)

0xrgbThis is a brainfuck version of Largest Number Printable, and this. Let's think about brainfuck interpreter such that, Has array that can be stretched left & right arbitrary large Each cell can contain arbitrary large integer Can contain negative integer too When the interpreter starts, ev...

 
@user202729 well any algorithm that solves a linear program will work, obviously, not just the simplex algorithm
 
10:00 AM
I mean, this one is a special case of the general LP problem so there may exists simpler alg.
 
lol
Is there a small usb speaker for raspberry pi
I'm too lazy to solder an I2C Amp to it
even audio hats must be soldered
It's not good for a tinkerer/programmer/student to be lazy, but I'm lazy anyway
 
 
2 hours later…
11:46 AM
smells like rotten spam already...
somebody trash that please!
 
@EriktheOutgolfer Spam hammered.
 
@Adám but not trashed yet as you can see
wait, how do you "hammer" spam
 
@EriktheOutgolfer Not sure. As soon as I flagged it as spam it was removed.
@EriktheOutgolfer Cacheing?
 
@Adám you were the sixth
@Adám I meant NMP's message above
 
@EriktheOutgolfer Ah, return of the sixth…
@EriktheOutgolfer Wait for a flood of mods.
 
11:50 AM
ah you flagged it?
 
@EriktheOutgolfer Sure. It shouldn't be here. See?
 
@Adám yeah, and as you can see you can't suspend NMP
btw how did that only need ~3 flags to get deleted instead of 5
 
@EriktheOutgolfer If somebody writes a message which gets flagged and then removed, does the user automatically get a suspension?
@EriktheOutgolfer I suspect ME removed it.
 
@Adám if it gets removed because of 5 flags then yes, they get a 30-minute suspension
but I'm not sure how one could suspend a feed
 
@EriktheOutgolfer How do you know NMP can't get suspended. I mean, if it consistently misbehaves.
 
11:53 AM
@Adám I guess because NMP doesn't do the posting, it's just a negative-ID profile used for feeds
 
I think the privileges order is problematic. We allow anyone to post questions, but they need 5 to upvote. If instead we didn't allow posting until the user had upvoted a couple of posts (questions or answers) that higher-rep users had subsequently also upvoted and that retained a positive score, then I think a lot of spam and low quality posts could be avoided. The idea is that newcomers learn what constitutes good posts before they can post.
 
@Adám eh, that's really unavoidable, since the philosophy is for the ability to ask for knowledge to extend to everybody who can access stackexchange.com, stackoverflow.com, superuser.com, serverfault.com, askubuntu.com, stackapps.com and mathoverflow.net
but some forums have a mod queue for new users' posts until the users reach specific requirements
 
@EriktheOutgolfer We don't?
 
@Adám no, we don't
but some other forums and q&a sites do
 
@EriktheOutgolfer We'll, my suggestion is kind of like an automated review queue.
 
12:07 PM
@Adám uh, we already have that here
 
@EriktheOutgolfer That isn't automated, and it is reactive, not proactive.
 
@Adám uh, I think first posts go there automatically, but maybe you mean that it should pass the review before getting posted?
 
@EriktheOutgolfer Yes. But even more. If a new user tries to post, the system will pop up and tell them to get a bit more familiar with the site before posting.
 
@Adám there is also the "test period" model, where a new user has reduced privileges for a specific time period, and then there are two cases: 1) the user gets "accepted" and granted all privileges or 2) the user gets "rejected" and banned
in the second case, I would suggest all of their traces get deleted right away
 
12:23 PM
1
A: Sandbox for Proposed Challenges

Galen IvanovCounting polystrips Polystrips are a subset of polyominoes. Each piece has two ends (= square with only one neighbor) and body (=squares with exactly two neighbors). Holes are forbidden. Miroslav Vicher's Puzzles Pages For example, there are 30 free(*) heptastrips (polystrips with length 7). H...

 
12:50 PM
Actually "Anyone can ask" is by design.
Surely it generates some LQ questions (especially on SO) but that's by design, there is little we can do.
The rep whores are also problematic. If everyone agree to only answer good questions, we don't need to worry about bad questions.
(also for unknown reasons I also tend to post more 'also' or 'too' than necessary, too)
@user202729 (not really unknown, just bad habit)
 
00:00 - 13:0014:00 - 00:00

« first day (2574 days earlier)      last day (2259 days later) »