Skip to content

This project tackles part of the N-Queens problem and is designed to manage the state of queens on a chessboard so that when N queens are placed on an NxN chessboard, no two queens threaten each other.

active 2024-05-032024-05-03 (UTC)

Complete coverage27,177 / 27,179 hourly files (100%) · 2 absent upstream2023-08-152026-09-20 (UTC)
Events
4
Pushes
2
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 1 days from 2024-05-03 to 2024-05-03. Pushes: 2 total, peak 2 in a day. Pull requests: 0 total, peak 0 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

ContributorContributionsPushesPRsComments
bryanctrl2200

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

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.