16
\$\begingroup\$

Related question.

Questions from Facebook Puzzles, Project Euler, UVa, SPOJ, and the like do not expire, unlike Google Code Jam or TopCoder. Therefore, in order to be able to discuss such problems without ruining the challenge, we need some guidelines on how far we can discuss them.

This post is for discussing what these guidelines should be.

\$\endgroup\$
0

4 Answers 4

24
\$\begingroup\$

There are three reasons why I think Project Euler etc. questions shouldn't be posted here.

The first is copyright. The question submitter

... represents, warrants and agrees that it will not contribute any Subscriber Content that (a) infringes, violates or otherwise interferes with any copyright or trademark of another party ...

(StackExchange Terms of Service).

The second is that Project Euler strongly discourages people from seeking help elsewhere: the correct place to compare solutions to PE problems is in the forum which you unlock by submitting a correct answer. See Will Jagy's report of discussion with PE about questions posted on math.stackexchange.com.

The third is common courtesy. Ripping off other sites isn't nice.

\$\endgroup\$
2
\$\begingroup\$

I am of the opinion that if people cheat by Googling for help, then they're only hurting themselves. Sometimes though, I even myself give up on a challenging question and want to read up on the answer. Therefore I don't think we should be too restrictive. The one policy I think we might want to enforce is no full coded solutions, although we should still allow snippets which explain something like a DP solution easier than using mathematical notation would.

\$\endgroup\$
6
  • 2
    \$\begingroup\$ True, but I hate stumbling into spoilers. So we need some kind of feature to prevent accidentally spoiling the problem for oneself, e.g., just by reading search summaries. \$\endgroup\$ Commented Jan 27, 2011 at 22:24
  • 2
    \$\begingroup\$ @Chris There is markup for spoilers we could use. \$\endgroup\$
    – moinudin
    Commented Jan 27, 2011 at 22:27
  • 1
    \$\begingroup\$ @marcog: Fancy. Now, how do we make the spoiler text not show up in search summaries? :-) \$\endgroup\$ Commented Jan 27, 2011 at 22:43
  • \$\begingroup\$ @Chris Does it show up? I've never used it. \$\endgroup\$
    – moinudin
    Commented Jan 27, 2011 at 22:44
  • \$\begingroup\$ @marcog: Neither. I guess we'll find out soon enough, once people start using it! :-) \$\endgroup\$ Commented Jan 27, 2011 at 22:48
  • 2
    \$\begingroup\$ @Chris @marco yes, it does show up in summaries (I've seen it on sci-fi.SE). Can we mix code and spoiler markup? \$\endgroup\$ Commented Jan 28, 2011 at 3:44
2
\$\begingroup\$

I don't think there should be a difference between puzzles that do expire and puzzles that don't expire. In the former case, posting a full solution ruins the contest for the participants, and in the latter it ruins the puzzle for the puzzlers. I don't think one is preferable to the other. I also don't think we ought to be the morality police; cheaters gunna cheat.

\$\endgroup\$
0
\$\begingroup\$

Some of the questions found on codegolf.com challenges are really great and I think worth replicating here. The advantage to this site oppose to codegolf is that all solutions are open so you can see the creativity of fellow golfers. I suppose the negative side is that it will allow for unscrupulous people to take advantage of this site and cheat at other competitions.

As Andy brought up there is another similar question which relates to competitions. I agree with the top answer that we should assist non-terminating contests with pseudo code. However, I think this question should directly relate to non-competition questions. I think this site is ultimately about having fun. The advantage of code-golf is that we can share our answers and learn from one another as code-golfers.

One last addition question. As it is possible that stackoverflow questions may be eventually be migrated, should we only allow non-stackoverflow questions?

Here are a few of the duplicates I found off hand:

CodeGolf.com:

Stackoverflow:

\$\endgroup\$
2
  • \$\begingroup\$ The Dancing Queens challenge on codegolf.com is very different from NQueens. \$\endgroup\$
    – hallvabo
    Commented Feb 3, 2011 at 13:41
  • 1
    \$\begingroup\$ The codegolf.com gives me an error ("This site can’t be reached") \$\endgroup\$
    – MilkyWay90
    Commented Mar 14, 2019 at 2:03

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .