Welcome to the N-Queens Solver repository! This project provides an implementation of the classic N-Queens problem but with the variations of the LinkedIn Game in Python. The N-Queens problem is a popular algorithmic puzzle that involves placing N chess queens on an N×N chessboard so that no two queens threaten each other. The N-Queens problem is a classic computer science problem. It is used to teach algorithms, recursion, and backtracking. This repository contains a Python solution that efficiently solves the problem for any given N. The LinkedIn Game
- Logs into LinkedIn and reads the N-Queens Grid.
- Solves the N-Queens problem for any given N.
- Utilizes backtracking to find all possible solutions.
- Outputs the solutions in a readable format.
- Uses Selenium to then Input the solution into LinkedIn
- Python 3.6 or higher
- Packages: Selenium and BeautifulSoup
- Clone the repository
- [WIP]
This project is licensed under the MIT License - see the LICENSE file for details.
Contact me here on Github!