N-queens problem: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

curprev 08:5608:56, 20 March 2011‎ rosettacode>Paddy3118‎ 112,370 bytes −13,011‎ →‎{{header|Groovy}}: Excessive output shortened
curprev 07:3207:32, 20 March 2011‎ rosettacode>Balrog‎ 125,381 bytes +15,395‎ →‎{{header|Groovy}}: new solution

curprev 08:4108:41, 15 March 2011‎ Moose talk contribs‎ m 109,986 bytes −2‎ →‎{{header|Python}}

curprev 16:1016:10, 5 February 2011‎ 111.173.72.183 talk‎ 109,988 bytes +1,751‎ Added quick Prolog solution, no explanation yet. Will get to the explanation part Real Soon Now<tm>.

curprev 16:1416:14, 30 January 2011‎ rosettacode>Dgamey‎ m 108,237 bytes −27‎ →‎Icon and Unicon: header simplification

curprev 12:0712:07, 28 December 2010‎ Toucan talk contribs‎ 108,264 bytes −131‎ →‎Alternate Fortran 77 solution: only one initialization since the backtracking algo returns to its first state after completion
curprev 11:0411:04, 28 December 2010‎ Toucan talk contribs‎ 108,395 bytes −99‎ →‎Alternate Fortran 77 solution: cleaning...
curprev 10:5410:54, 28 December 2010‎ Toucan talk contribs‎ m 108,494 bytes +25‎ →‎Alternate Fortran 77 solution: be even :-)
curprev 06:4906:49, 28 December 2010‎ Toucan talk contribs‎ 108,469 bytes +25‎ →‎Alternate Fortran 77 solution

curprev 23:0923:09, 27 December 2010‎ Toucan talk contribs‎ 108,444 bytes −293‎ →‎Alternate Fortran 77 solution: a bit faster, and should conform to f66 as well
curprev 13:2213:22, 27 December 2010‎ Toucan talk contribs‎ 108,737 bytes +211‎ →‎Alternate Fortran 77 solution
curprev 13:1513:15, 27 December 2010‎ Toucan talk contribs‎ 108,526 bytes +81‎ →‎Alternate Fortran 77 solution: remove automatic arrays, which are not F77
curprev 10:0410:04, 27 December 2010‎ 79.21.5.141 talk‎ 108,445 bytes +9‎ →‎{{header|D}}

curprev 21:1721:17, 26 December 2010‎ Toucan talk contribs‎ 108,436 bytes +409‎ →‎Alternate Fortran 77 solution: + output
curprev 20:0620:06, 26 December 2010‎ Toucan talk contribs‎ 108,027 bytes +1,394‎ →‎{{header|Fortran}}: adding F77... could be optimized a bit, to be continued ;-)
curprev 10:4310:43, 26 December 2010‎ rosettacode>Fwend‎ m 106,633 bytes −671‎ →‎{{header|C}}: adjusted formatting

curprev 23:3723:37, 25 December 2010‎ rosettacode>Fwend‎ 107,304 bytes +1,112‎ →‎{{header|D}}
curprev 19:5719:57, 25 December 2010‎ Toucan talk contribs‎ m 106,192 bytes −20‎ →‎{{header|R}}: the other case can't happen since we work with permutations !

curprev 09:3009:30, 22 December 2010‎ Toucan talk contribs‎ 106,212 bytes +470‎ adding R

curprev 05:5705:57, 17 November 2010‎ rosettacode>Gerard Schildberger‎ m 105,742 bytes +13,869‎ →‎{{header|Ruby}}

curprev 13:2013:20, 2 November 2010‎ Lupus talk contribs‎ 91,873 bytes +13,538‎ added Fortran

curprev 16:0016:00, 28 October 2010‎ rosettacode>Mwn3d‎ m 78,335 bytes −12‎ →‎{{header|Java}}: The C solution changed, this is no longer a translation
curprev 15:1915:19, 28 October 2010‎ rosettacode>Norbert88‎ 78,347 bytes +3,948‎ The Wikipedia C-Code Link was broken. I placed my solution.

curprev 00:3200:32, 20 October 2010‎ MikeMol talk contribs‎ m 74,399 bytes −2‎ Use Template:Task instead of Template:Puzzle. The Puzzle template's meaning is rather vague, and there is probably a better way to handle that information.