« first day (3206 days earlier)      last day (1646 days later) » 

12:19 AM
-1
Q: Today's challenge.. Python List

Bobby WoodtoothToday's challenge: Given an ordered list of at least 3 unique integer 2D points forming a polygon, determine if the resulting polygon is Rectilinear. A polygon is rectilinear if every interior angle is a right angle. The edges do not necessarily have to be purely vertical or horizontal (paralle...

 
12:31 AM
can someone edit into that so i can hammer it and get rid of it
it's literally just plagiarized
 
12:48 AM
@HyperNeutrino I love how they didn't even copy the markdown of my challenge, they just copied the text and it's all formatted wrong XD
5
 
^ ikr xD like i was looking at it and wondering if I was reading it wrong but then I realized they copied it wrong and markdown changed because of it
where's my caretreply ._.
i love how they added a line at the end like "oh geez completely different challenge now" xd
 
1:41 AM
The troll copy pasted a farewell for the wrong moderator. @DJMcMayhem, is it possible for you to suspend this user?
 
I think its a BAD idea to suspend
They are a new user and they may need help understanding the rules
Take it easy on them
@JoKing
 
@TomMinor ... They're deliberately trolling in bad faith. Also, who are you?
 
My name is Tom Minor. I am well known chiefly on Stack Overflow
Well tom minor is my nickname
MY real name is a bit differnt
Sorry, did not mean to use caps for my.
Also, it is a fair presumption that they are intentionally trolling but they are new
 
Sorry, I honestly thought you were an alt-account of the troll for a good second before I saw your account was several years old. Anyway, the user is only copy pasting questions/answers and claiming them as their own. I doubt this is just a misunderstanding
 
I see
 
1:50 AM
@TomMinor I doubt they're going to stop trolling and become a model member of the community
 
But they are also new
 
"New" doesn't excuse trolling. Spammers still get banned, even if they are "new"
 
okay. makes sense
but I see the user thanked a mod on meta. wouldnt that be a kind deed?
 
Hey guys, do any of the mods around here ever mentioned that they would want to have an alt-account for trolling? ;)
"Alt account of CodeGolf moderator

Just havin some fun ;)"
That's a quote from our troll's "About me" section
 
LOL
Maybe there is some mod behind the scenes having some fun
Also, although he is plausible a genuine troll why not call him by his name? Bobby Woodtooth
 
1:58 AM
@TomMinor The response is copy pasted from a different thread about different moderator
 
@JoKing so I take it Bobby is viable for suspension now, after posing as someone they aren't.
 
They probably are not a mod. But what if they are?
I mean you never know
 
@TomMinor we only have two mods left here on CGCC
 
@TomMinor Do you have any interest in code golf? Or are you just here to defend a troll?
 
One is DJMcMayhem, who it surely cant be, as it was his question that was plagerised
 
2:01 AM
I am not defending anyone. I am just trying to offer alternate perspective at the situation
yeah i aggre its not djmcmayhem
what about the other one?
 
And the other mod is Doorknob, who I suspect wouldn't do such a thing.
@JoKing could probably tell you more
 
"suspect" is the prime word my fellow!

I SAY DO A COMPLETE INVESTIGATION OF DOORKNOB!
 
There's no reason for a mod to create an alt account and start trolling. It's far more likely that the troll is doing more trolling and pretending to be so
4
@TomMinor And it's getting more and more likely that you're an alt account for the troll
4
 
I have about 100 rep.
I have been on SO for 3 years!
Lets not start up with random accusations. Lets just calm down
Anyway, I have some interest in codegolf
I have always been the most active in Stack overflow
 
"Most active" -> "<100 rep"?
 
2:06 AM
After all, in the early days of code golf, it was on stack overflow
 
What language would you like to golf in?
 
Is html and Css viable?
 
Er yes, but that's only really for challenges, since that's not really a programming language
 
ah the analogy comparing my active ness and my reputation. that is merely due to me being most active in SO chat
 
do we have a challenge to write a non-palindromic program with non-palindromic output that gives the same output when reversed?
 
2:09 AM
@JoKing what about Esoteric programming languages?

Such as whitespace
 
@Jono2906 I mean... What if I just really really wanted a second copy of my question floating around? :P
 
@TomMinor Yeah sure, that's fine. How well do you know Whitespace? Have you looked at Tips for golfing in whitespace?
 
It's too early to rule me out. I'll start investigating me
 
Funny one DJ! Whats the status of doorknob?
The only reason I ever came to code golf in the first place was because the code-golf tag on SO is now blacklisted
 
@TomMinor It's definitely not him (or Mego or Dennis or any other former mod)
 
2:18 AM
@DJMcMayhem Wait a second. You're not in that list :O. Clearly guilty
 
I see this is the only post that has whitespace:
https://codegolf.stackexchange.com/questions/12174/golf-you-a-double-quine-for-greater-good
how interesting
 
@TomMinor You can answer most questions in any language. For example, here is "Hello, World!" in Whitespace
 
I am going to make a challenge that only allows HTML whatsoever!
 
@TomMinor Erm, please don't. Or at least post it in the Sandbox first to get feedback before posting to main
Language restricted questions are usually badly received, and I doubt HTML has any special qualities that would make it interesting
 
2:44 AM
So djmcmayhem is the confirmed troll @JoKing ??
 
 
1 hour later…
3:46 AM
0
Q: Making Fibonacci Cry

sugarfiIntroduction The Fibonacci sequence is a mathematical sequence in which each term is the sum of the \$2\$ terms before it; the first two terms are \$0\$ and \$1\$. The first few terms are \$0, 1, 1, 2, 3, 5, 8, 13\$. However, it is possible to make variations of this sequence, where each term is...

 
4:07 AM
@JoKing I cant find any answers to code gold that are in html
 
4:43 AM
but yes, kind of rare
 
 
1 hour later…
5:50 AM
0
Q: HTML & inline CSS ONLY!

Tom MinorThis is a challenge that has never been executed before. In this challenge you are ONLY allowed to use HTML and limited CSS. By limited, I mean you can only use CSS in-line within the particular HTML element. So you can not add a style element in the header and host CSS there. Remote CSS is n...

 
 
7 hours later…
A _
1:16 PM
@NewMainPosts Since randomness is undefined, I guess I could cheat by choosing a determined video.
Pure HTML, 764 bytes: ```<a href="https://www.youtube.com/watch?v=l01sdzJHCCM&feature=player_embedded">1</a><a href="https://www.youtube.com/watch?v=l01sdzJHCCM&feature=player_embedded">1</a><a href="https://www.youtube.com/watch?v=l01sdzJHCCM&feature=player_embedded">1</a><br/>
<a href="https://www.youtube.com/watch?v=l01sdzJHCCM&feature=player_embedded">1</a><a href="https://www.youtube.com/watch?v=l01sdzJHCCM&feature=player_embedded">1</a><a href="https://www.youtube.com/watch?v=l01sdzJHCCM&feature=player_embedded">1</a><br/>
(It is great that OP also hasn't defined what is a table!)
Now trying to golf it using CSS.
 
A _
1:35 PM
I can't use CSS to do this.
 
A _
1:46 PM
 
A _
2:01 PM
We'd sell golf dor a very high price.
s/golf/gold/; s/dor/for/
 
A _
2:17 PM
I love the new main post! It is extremely easy!
 
1
Q: Average Two Letters

sugarfiIntroduction Every letter can be represented as ASCII. For example, a is 97, and S is 83. As well all know, the formula for averaging two numbers x and y is (x+y)/2. I'm pretty sure you can see where this is going. Your challenge is to average two letters. Challenge Your program must take two ...

 
 
2 hours later…
4:01 PM
1
Q: Horizontally mirror a brainflak program

Redwolf ProgramsYour task is to write a program or function which takes a brainflak program as input (assume it contains only ()[]{}<>), and output a visually mirrored copy of it. If you reversed a brainflak program as a string, say ({}()) (add one to an input), you would get ))(}{(, which is not valid. Instea...

 
 
4 hours later…
8:16 PM
hello!
consider the following game. I think of an n letter English word from some standard dictionary.
you guess n letter words and each time I tell you how many words has in common with yours
you need to make the minimum number of guesses to get the word right
can anyone see how to write code to do this?
I guess if a word has lots of anagrams that are valid words then you just guess successive words with that set of letters until you get it
 
@Anush you mean how many letters in common?
 
@dzaima yes
you guess n letter words and each time I tell you how many letters has in common with yours
 
ngn
so, like bulls&cows but without the bulls
 
oh I don't know that
 
@Anush there are certainly strategies that vary in how good they are depending on the specific word, and optimizing a minimum amount of guesses for the sum of all dictionaries might be a bit hard
 
8:20 PM
@dzaima I like hard :) I was thinking of just fixing some English dict
is there an obvious one online ?
hmm .. drive.google.com/file/d/1oGDf1wjWp5RF_X9C7HoedhIWMh5uJs8s/view has lots of words I don't think are real!
something simpler and shorter
AA (Hawaiian) a volcanic rock consisting of angular blocks of lava with a very rough surface [n -S]
:)
so let's assume a much smaller dictionary than that
 
ngn
there's apt-get install wbritish or wamerican
goes into /usr/share/dict/british-english
 
oh cool.. let's see how big that is!
 
ngn
~100k words
 
AIDS's
3
hmm
still lots of words I wouldn't allow
 
@Anush I doubt there's anyone in the world who has the exact same thoughts about what words are valid :p
 
8:26 PM
:)
I just want a non massive dictionary
 
ngn
apt-get install wbritish-small is ~50k words
 
oh that looks interesting
 
ngn
"AIDS's" is still there :P
 
I am filtering out the dict so it only has lines with only [a-z] in them
just as soon as I remember how to do that :)
 
ngn
good idea
 
8:27 PM
@Anush | grep -P "^[a-z]+$"
 
grep '^[[:lower:]]*$'
:)
 
ngn
$ grep '^[a-z]\+$' < /usr/share/dict/british-english-small | wc -l
40120
 
@Anush huh, why does [a-z] by default allow for more chars than [[:lower:]]?
 
éclair
hmm
how was that allowed?
@dzaima I don't know
 
@Anush just do ^[abcdefghijklmnopqrstuvwxyz]*$ and if that doesn't solve it, i don't know ¯\_(ツ)_/¯
 
ngn
8:32 PM
from `man grep`:
LC_ALL, LC_COLLATE, LANG
These variables specify the locale for the LC_COLLATE category, which determines the collating sequence used to
interpret range expressions like [a-z].
LANG= (set $LANG to an empty string) solves it too
 
@ngn that works!
40081
 
ngn
nasty little mine in a basic utility...
 
export LANG=en_GB works too
ok so.. how do we write the code :)
to find the minimum set of question needed
I suppose its the minimum depth of the search tree
I wonder what it is?
and can a ccgc challenge be made out of this?
(that's always a secondary question... :))
 
@Anush how is "how many in common" defined? is aa & aa 2 or 1? aa & a? a & aa?
 
@dzaima oh I forgot a crucial rule!
all the letters in the word have to be different.. back to grepping
11667 words
grep -v '[^[:lower:]]' /usr/share/dict/british-english-small| sed '/(.).*\1/d'|wc -l
that's how I did it
@dzaima is it clear now?
I don't know how windows people do anything without grep and sed :)
 
ngn
8:47 PM
@Anush clippy helps them
ridiculous upper bound 2^26 for all subsets of a-z
and what about anagrams?
 
@ngn what's that an upper bound for?
 
ngn
14 mins ago, by Anush
to find the minimum set of question needed
 
@ngn the upper bound of that is 26, as letters are distinct and we can just ask each individually to get all the info
 
ngn
@dzaima much better idea :)
so we could try first the most common english letter, filter the dictionary accordingly, and repeat
 
@ngn rather than the most common, check the most "controversial" (the one closest to 50/50 usage) letter from the current selection
 
ngn
8:54 PM
this could be a good baseline. there may still be a better strategy that guesses more letters at a time.
 
and rather than the most controversial letter, the most controversial letter group (which might get a bit hard to find)
 
For each game let's fix n
So for n=5 you can only ask with 5 letter words and the secret is also a 5 letter wordsl
a 5 letter word
 
hmm, for n=5 would we define controversial as closest to ⅙ for each output of 0-6? 6 would be very rare to get
@Anush can we ask any letter combination or must we also guess proper words?
 
ngn
letter frequencies: ((6941;"e");(5847;"s");(5519;"a");(5135;"i");(5073;"r");(4491;"n");(4171;"t");(4044;"o");(3824;"l");(3269;"d");(2933;"u");(2786;"c");(2668;"g");(2120;"p");(2119;"h");(2035;"m");(1629;"b");(1382;"y");(1232;"k");(1159;"f");(1072;"w");(793;"v");(237;"j");(209;"x");(167;"q");(145;"z")) from a total of 11667 words
 
Proper words
 
9:11 PM
@Anush hm, i get 11592 for that exact code (and 11570 with LANG= and in a custom program)
@Anush ah, so determining the best controversiality is easy as you've got a very limited search space
 
I hope so!
I am really interested to know what the tree depth will be
I also just want to play the game against the computer :)
@ngn I don't think I would have guessed that s was the second most common letter
 
1
Q: Longest pristine(ish) codepoint run

Redwolf ProgramsYour challenge is to create the longest run of characters with incrementing Unicode codepoints in a pristine program as you can. To keep things simple, I'll abridge the definition for this challenge to be "any program which produces no errors but will error if any one character is removed". Let'...

 
9:27 PM
@dzaima do you have any ideas how to do it?
 
ngn
@Anush the usual stats are somewhat distorted by the requirement that letters in a word must be unique
 
@Anush go trough all words, determine controversiality in the currently left word set, pick best. question is what's the best definition of controversiality, and this method probably isn't optimal
 
ngn
@Anush why not post it as a challenge?
 
@ngn question is, what would the challenge be? code-golf for optimal solution (which might or might not be feasible to test/run)? some optimization challenge with the possibility of a 'perfect' answer?
 
ngn
@dzaima the latter - to find the tree depth, either perfect or best known
 
9:35 PM
If we ask for optimality then what is the winning criterion?
oh I see, the score if the tree depth?
one problem is that the tree will have total size 11667 so I am not sure how people will present their answers
I can't do it for a couple of days in any case but I would be very happy if someone else wanted to post it as a challenge
2414 words that have 5 letters. 1565 have 4 letters.2648 have 6. 2309 have 7. 1380 have 8
 
ngn
@Anush as a fan of the language k, i laugh at data sets smaller than a billion records :)
 
so n = 6 seems potentially most interesting
@ngn :)
is that a real language?
 
ngn
very real, a programming language
 
K is a proprietary array processing programming language developed by Arthur Whitney and commercialized by Kx Systems. The language serves as the foundation for kdb+, an in-memory, column-based database, and other related financial products. The language, originally developed in 1993, is a variant of APL and contains elements of Scheme. Advocates of the language emphasize its speed, facility in handling arrays, and expressive syntax. == History == Before developing K, Arthur Whitney had worked extensively with APL, first at I. P. Sharp Associates alongside Ken Iverson and Roger Hui, and later at...
 
ngn
yeah, that one
 
9:42 PM
are there any letters without programming languages named after them?
 
@Anush no
 
:)
I have to go.. chat again soon
 
@Anush Probably a few Greek ones
 
10:21 PM
:)
 
10:45 PM
Good morning everyone!
 
@Jono2906 Evening :P
 
ngn
night
 
11:09 PM
0
A: Sandbox for Proposed Challenges

Albert CappRoom volume as a function of paint on the walls/ceiling Task: Write a function that will take in the size of a room (height, width, and length) and a number of paint layers (given that the layers are of a consistent thickness) and return the area of free space in the room after that many layers ...

 
11:43 PM
^ painted "hand made" html and css:)
 
0
Q: Draw a fuzzy grid

mschauerPrint the ASCII version of a random grid. ################################################################################ # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # ##...

 

« first day (3206 days earlier)      last day (1646 days later) »