Placing N chess queens on an NxN chessboard so that no two queens threaten each other.
-
Updated
Feb 14, 2017 - Java
Placing N chess queens on an NxN chessboard so that no two queens threaten each other.
Openstack deployment using saltstack
Assignment 2 Repository for the CSC3060 module at Queen's University Belfast.
A series of analyses on data from the best reality competition, RuPaul's Drag Race
Here you will find my version of the algorithm that solves the Queens Problem
N-Queens solution using optimization techniques
Solving 8-Queens problem
Graphical Implementation of N-Queen's Algorithm using Back Tracking
Terminal implementation of the queen problem (place 8 chess queens on a 8x8 chessboard, none of them must see another one)
Text-simulator game to provide first-year QC students with resources and guidance
Add a description, image, and links to the queens topic page so that developers can more easily learn about it.
To associate your repository with the queens topic, visit your repo's landing page and select "manage topics."