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)

2 July 2024

21 June 2024

15 June 2024

12 June 2024

11 June 2024

4 June 2024

1 June 2024

25 May 2024

21 April 2024

20 April 2024

19 April 2024

18 April 2024

17 April 2024

16 April 2024

15 April 2024

13 April 2024

28 February 2024

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 2023Amalawi talk contribs 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

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