This repository contains a collection of search algorithms implemented to solve the N-Queens problem as part of an Intelligent Systems course. It includes solutions using Breadth-First Search, Uniform Cost Search, Iterative Deepening Search, A*, and Greedy algorithms, each separated into individual Python scripts for clarity and ease of use.
active 2024-04-27 → 2024-04-27 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2024-04-27 to 2024-04-27. Pushes: 3 total, peak 3 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: 1 total, peak 1 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 |
|---|---|---|---|---|
| eng-MohamedFayed | 3 | 3 | 0 | 0 |
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 — 1 stars here means stars gained during the window, not the repo's star count.