Data commit

Task/N-queens-problem/Raku/n-queens-problem.raku

@@ -0,0 +1,24 @@
+sub MAIN(\N = 8) {
+    sub collision(@field, $row) {
+        for ^$row -> $i {
+            my $distance = @field[$i] - @field[$row];
+            return True if $distance == any(0, $row - $i, $i - $row);
+        }
+        False;
+    }
+    sub search(@field, $row) {
+        return @field if $row == N;
+        for ^N -> $i {
+            @field[$row] = $i;
+            return search(@field, $row + 1) || next
+                unless collision(@field, $row);
+        }
+        ()
+    }
+    for 0 .. N / 2 {
+        if search [$_], 1 -> @f {
+            say @f;
+            last;
+        }
+    }
+}