✨ Description:
This project solves the classic N-Queens Problem using C#.
It provides both single-threaded and multi-threaded solutions and compares their performance.
This project solves the problem of placing N queens on a chessboard so that no two queens threaten each other.
Performance comparison is made between single-threaded and multi-threaded solutions.
- ✅ Solves the N-Queens problem
- ✅ Single-threaded solution
- ✅ Multi-threaded (thread) solution
- ✅ Calculates the number of solutions
- ✅ Measures and compares solution times
- 📂 Open the project in Visual Studio or using the dotnet CLI.
▶️ Run the program.- 🔢 Enter the value of N you want to solve for in the console.
- ⏳ The program will compute the solutions and compare the times.
- 💻 C#
- 🖥 .NET 6.0
- 🧵 System.Threading
- ⏱ System.Diagnostics
Contributions are welcome!
- 🐞 Report issues via the Issues tab.
- 🚀 Submit pull requests for improvements.
This project is licensed under the MIT License. See the LICENSE file for details.