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.

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

24 February 2024

23 February 2024

6 January 2024

3 November 2023

8 September 2023

30 August 2023

10 July 2023

9 July 2023

10 June 2023

3 February 2023

  • curprev 21:1421:14, 3 February 2023imported>Amalawi 483,487 bytes +1,104 This is a solution adapted from Forth Dimensions Volume II Number 1, article titled "Recursion - The Eight Queens Problem by Jerry LeVan. It uses the same technique of Wirth with the left diagonal adjusted since there are no negative indexses

23 January 2023

30 October 2022

23 October 2022

2 September 2022

27 August 2022

26 August 2022

25 August 2022

15 August 2022

20 June 2022

4 June 2022

3 June 2022

13 May 2022

  • curprev 06:5206:52, 13 May 2022imported>Hakank 464,270 bytes +1,596 →‎{{header|Picat}}: Some clarifications in text, added {{out}}. Added CP version.and "naive" version. Added a short text on comparison between the solvers.

25 April 2022

24 April 2022

17 April 2022

16 April 2022

14 April 2022

28 February 2022

3 February 2022

2 February 2022

19 January 2022

9 January 2022

11 December 2021

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)