Editing Talk:1542: Scheduling Conflict

Jump to: navigation, search
Ambox notice.png Please sign your posts with ~~~~

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 14: Line 14:
  
 
A few remarks, but I'll leave it to someone better versed in the English language to work it into the explanation if he/she wishes to:
 
A few remarks, but I'll leave it to someone better versed in the English language to work it into the explanation if he/she wishes to:
 
+
  - Is this an American thing, to assume the current world champion must be last year's national champion?
- Is this an American thing, to assume the current world champion must be last year's national champion?
+
  - there is a play on words in the title(s), they would be read as "National Scheduling Conflict: Championships canceled" which begs the question "Which championships?". It is only when reading the NSCC banner that you could assume something like the "National Scheduling Conflict Championships" exists.
 
+
  - How did they get a world champion if the championships are presumably always cancelled? Does that mean the prize is claimed anyway or that the champion is actualy not as good at scheduling conflicts as all those people cancelling because of scheduling conflicts.  
- there is a play on words in the title(s), they would be read as "National Scheduling Conflict: Championships canceled" which begs the question "Which championships?". It is only when reading the NSCC banner that you could assume something like the "National Scheduling Conflict Championships" exists.
+
  - Now I'm overthinking, but there is no reason for a spokesperson to be a good at the activity of the organisation he/she is spokesperson for, or is there? {{unsigned ip|108.162.254.116}}
 
+
  -
- How did they get a world champion if the championships are presumably always cancelled? Does that mean the prize is claimed anyway or that the champion is actualy not as good at scheduling conflicts as all those people cancelling because of scheduling conflicts.  
 
 
 
- Now I'm overthinking, but there is no reason for a spokesperson to be a good at the activity of the organisation he/she is spokesperson for, or is there? {{unsigned ip|108.162.254.116}}
 
  
 
This reminds me a lot of comic #1466: Phone checking. Both are about an obscure championship, and both are interrupted by the nature of said championship. --[[User:Quantanaut|Quantanaut]] ([[User talk:Quantanaut|talk]]) 17:08, 24 June 2015 (UTC)
 
This reminds me a lot of comic #1466: Phone checking. Both are about an obscure championship, and both are interrupted by the nature of said championship. --[[User:Quantanaut|Quantanaut]] ([[User talk:Quantanaut|talk]]) 17:08, 24 June 2015 (UTC)
Line 37: Line 34:
 
: I agree, the current first couple paragraphs are ridiculous. If this silly way of reading the two newspaper headlines as separate lines has to be mentioned, it should be at the end, as a kind of dubious and totally unlikely alternative interpretation. --[[User:RenniePet|RenniePet]] ([[User talk:RenniePet|talk]]) 10:22, 26 June 2015 (UTC)
 
: I agree, the current first couple paragraphs are ridiculous. If this silly way of reading the two newspaper headlines as separate lines has to be mentioned, it should be at the end, as a kind of dubious and totally unlikely alternative interpretation. --[[User:RenniePet|RenniePet]] ([[User talk:RenniePet|talk]]) 10:22, 26 June 2015 (UTC)
  
;constraint programming
+
== constraint programming ==
 +
 
 
I think the championship is referring to computer programs that solve scheduling conflicts (a NP hard problem) google "constraint programming scheduling problems"
 
I think the championship is referring to computer programs that solve scheduling conflicts (a NP hard problem) google "constraint programming scheduling problems"
  

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)

Templates used on this page: