Skip to content
#

n-queens-problem

Here are 120 public repositories matching this topic...

This Python code solves the N-Queens problem using a genetic algorithm. The goal is to place N chess queens on an N×N chessboard so that no two queens can attack each other. The algorithm trying different queen arrangements over many generations, selecting the best ones, mixing them up, and occasionally making small changes (mutations).

  • Updated Feb 8, 2024
  • Jupyter Notebook

👩‍💻This repository provides Python implementations of a variety of fundamental algorithms and problem-solving techniques. From Knapsack and TSP to BFS, DFS, and more, explore practical examples to enhance your algorithmic skills. Perfect for students and developers seeking to grasp essential algorithms in Python.

  • Updated Feb 5, 2024
  • Python

Improve this page

Add a description, image, and links to the n-queens-problem topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the n-queens-problem topic, visit your repo's landing page and select "manage topics."

Learn more