Dieses Repository enthält eine Lösung für das N-Damen-Problem, implementiert in der Programmiersprache Scala. Das N-Damen-Problem ist eine Erweiterung des klassischen 8-Damen-Problems, bei dem es darum geht, N Damen so auf einem NxN-Schachbrett zu platzieren, dass keine zwei Damen sich gegenseitig angreifen können.
active 2024-06-27 → 2024-07-03 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 7 days from 2024-06-27 to 2024-07-03. Pushes: 12 total, peak 7 in a day. Pull requests: 2 total, peak 2 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| Pascal1414 | 10 | 9 | 1 | 0 |
| JonathanXDR | 4 | 3 | 1 | 0 |
Recent activity
Latest issues, pull requests and releases
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.