Timeline for Solve the eight queens problem at compile-time [closed]
Current License: CC BY-SA 3.0
23 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 30, 2016 at 6:27 | history | closed |
Riker undergroundmonorail El'endia Starman DJMcMayhem user45941 |
Not suitable for this site | |
| Apr 30, 2016 at 2:01 | review | Close votes | |||
| Apr 30, 2016 at 6:27 | |||||
| Apr 29, 2016 at 23:13 | history | edited | cat |
no reason for that tag, considering the mention of haskell
|
|
| Nov 26, 2015 at 3:02 | answer | added | DU Jiaen | timeline score: 0 | |
| Jul 11, 2014 at 11:10 | history | edited | Peter Taylor |
edited tags
|
|
| Jul 28, 2013 at 8:35 | answer | added | breadbox | timeline score: 10 | |
| Oct 6, 2012 at 12:33 | answer | added | han | timeline score: 8 | |
| Oct 5, 2012 at 6:25 | comment | added | J B | The problem with allowing any language is that Lisps will spoil the fun for anything where the “compile time” constraint is there as a proxy for “something different from run time”. | |
| Oct 12, 2011 at 4:30 | answer | added | R. Martinho Fernandes | timeline score: 22 | |
| Jul 30, 2011 at 2:50 | comment | added | user unknown | @Martinho: I guess it is possible with the Scala Type System, but I'm not able to suggest a solution. I'm sorry. | |
| Jul 22, 2011 at 23:12 | comment | added | Ming-Tang | too hard, I just did parsing on Haskell type system gist.github.com/456802 | |
| Jul 20, 2011 at 19:14 | vote | accept | R. Martinho Fernandes | ||
| Jul 20, 2011 at 14:57 | answer | added | fredoverflow | timeline score: 54 | |
| Jul 17, 2011 at 20:55 | history | tweeted | twitter.com/#!/StackCodeGolf/status/92698954369728513 | ||
| Jul 16, 2011 at 19:10 | comment | added | R. Martinho Fernandes | As long as it's computed, I think it's fine. But efficient solutions get more points of course :) | |
| Jul 16, 2011 at 18:43 | comment | added | ceased to turn counterclockwis | Is it sufficient to do the brute-force-solution? | |
| Jul 16, 2011 at 15:56 | history | edited | R. Martinho Fernandes | CC BY-SA 3.0 |
added 101 characters in body; edited tags
|
| Jul 16, 2011 at 15:55 | comment | added | R. Martinho Fernandes | @FUZxxl: Yes. I'll edit the question. | |
| Jul 16, 2011 at 15:53 | comment | added | FUZxxl | Can I also use the type system of Haskell? AFAIK it should be turing complete. | |
| Jul 16, 2011 at 3:35 | comment | added | R. Martinho Fernandes | @user: Because I'm interested in a C++ TMP solution. If you know of a language that has very similar constructs, feel free to post an answer, though. | |
| Jul 16, 2011 at 2:52 | comment | added | user unknown | Why don't you allow different languages? | |
| Jul 15, 2011 at 23:50 | history | edited | R. Martinho Fernandes | CC BY-SA 3.0 |
added 1 characters in body
|
| Jul 15, 2011 at 23:25 | history | asked | R. Martinho Fernandes | CC BY-SA 3.0 |